./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-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 3cca4963db77635bc2da65f99e90064d806437e6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:26:31,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:26:31,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:26:31,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:26:31,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:26:31,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:26:31,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:26:31,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:26:31,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:26:31,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:26:31,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:26:31,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:26:31,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:26:31,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:26:31,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:26:31,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:26:31,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:26:31,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:26:31,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:26:31,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:26:31,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:26:31,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:26:31,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:26:31,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:26:31,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:26:31,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:26:31,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:26:31,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:26:31,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:26:31,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:26:31,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:26:31,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:26:31,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:26:31,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:26:31,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:26:31,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:26:31,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:26:31,185 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:26:31,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:26:31,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:26:31,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:26:31,187 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:26:31,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:26:31,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:26:31,188 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:26:31,188 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:26:31,188 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:26:31,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:26:31,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:26:31,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:26:31,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:26:31,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:26:31,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:26:31,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:26:31,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:26:31,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:26:31,190 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:26:31,191 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:26:31,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:26:31,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:26:31,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:26:31,191 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:26:31,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:26:31,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:26:31,192 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:26:31,193 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:26:31,193 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 -> 3cca4963db77635bc2da65f99e90064d806437e6 [2019-01-14 02:26:31,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:26:31,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:26:31,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:26:31,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:26:31,269 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:26:31,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2019-01-14 02:26:31,330 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a06d0f2/7800150764a94a7592cbfca24b08008d/FLAG4d67bccc6 [2019-01-14 02:26:31,807 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:26:31,809 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2019-01-14 02:26:31,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a06d0f2/7800150764a94a7592cbfca24b08008d/FLAG4d67bccc6 [2019-01-14 02:26:32,120 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a06d0f2/7800150764a94a7592cbfca24b08008d [2019-01-14 02:26:32,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:26:32,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:26:32,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:32,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:26:32,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:26:32,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7471e6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32, skipping insertion in model container [2019-01-14 02:26:32,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:26:32,204 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:26:32,554 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:32,571 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:26:32,637 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:32,703 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:26:32,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32 WrapperNode [2019-01-14 02:26:32,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:32,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:32,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:26:32,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:26:32,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:32,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:26:32,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:26:32,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:26:32,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (1/1) ... [2019-01-14 02:26:32,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:26:32,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:26:32,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:26:32,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:26:32,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26: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 [2019-01-14 02:26:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:26:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:26:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:26:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:26:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:26:32,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:26:33,285 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:26:33,285 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:26:33,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:33 BoogieIcfgContainer [2019-01-14 02:26:33,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:26:33,288 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:26:33,288 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:26:33,292 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:26:33,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:33,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:26:32" (1/3) ... [2019-01-14 02:26:33,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1acb97da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:33, skipping insertion in model container [2019-01-14 02:26:33,294 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:33,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:32" (2/3) ... [2019-01-14 02:26:33,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1acb97da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:33, skipping insertion in model container [2019-01-14 02:26:33,296 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:33,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:33" (3/3) ... [2019-01-14 02:26:33,299 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2019-01-14 02:26:33,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:26:33,357 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:26:33,357 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:26:33,357 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:26:33,358 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:26:33,358 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:26:33,358 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:26:33,358 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:26:33,359 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:26:33,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:26:33,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:26:33,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:33,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:33,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:33,408 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:33,408 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:26:33,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:26:33,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:26:33,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:33,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:33,411 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:33,411 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:33,420 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L554-2true [2019-01-14 02:26:33,421 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 14#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3#L551-3true main_#t~short9 := main_#t~short7; 5#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-6true assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 12#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 11#L554-2true [2019-01-14 02:26:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:26:33,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-01-14 02:26:33,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-01-14 02:26:33,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:34,245 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-14 02:26:34,528 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:26:34,709 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:26:35,070 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-14 02:26:35,081 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:35,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:35,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:35,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:35,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:35,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:35,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:35,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:35,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:26:35,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:35,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:35,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,589 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-14 02:26:35,824 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:26:35,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:37,155 WARN L181 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:37,189 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:37,195 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:37,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:37,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:37,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:37,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:37,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:37,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:37,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:37,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:37,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:37,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:37,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:37,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:37,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:37,502 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:37,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:37,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:37,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:37,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:26:37,510 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:37,511 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 [] [2019-01-14 02:26:37,795 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:37,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:37,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:37,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:37,987 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 [2019-01-14 02:26:37,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-14 02:26:38,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2019-01-14 02:26:38,128 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 [2019-01-14 02:26:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:26:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2019-01-14 02:26:38,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:26:38,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:38,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:26:38,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:38,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 02:26:38,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:38,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-14 02:26:38,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:38,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2019-01-14 02:26:38,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:26:38,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:26:38,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-01-14 02:26:38,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:38,148 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-01-14 02:26:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-01-14 02:26:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-14 02:26:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 02:26:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-01-14 02:26:38,178 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-14 02:26:38,178 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-14 02:26:38,179 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:26:38,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-01-14 02:26:38,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:38,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:38,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:38,182 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:26:38,183 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:38,183 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 226#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2019-01-14 02:26:38,183 INFO L796 eck$LassoCheckResult]: Loop: 246#L551-1 assume !main_#t~short7; 227#L551-3 main_#t~short9 := main_#t~short7; 228#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 232#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 242#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 247#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2019-01-14 02:26:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:26:38,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:38,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2019-01-14 02:26:38,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:38,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:38,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:38,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:26:38,310 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:26:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:26:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:26:38,313 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-14 02:26:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:38,361 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 02:26:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:26:38,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-01-14 02:26:38,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:26:38,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2019-01-14 02:26:38,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:26:38,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:26:38,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-01-14 02:26:38,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:38,368 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 02:26:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-01-14 02:26:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 02:26:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:26:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-14 02:26:38,371 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 02:26:38,372 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 02:26:38,372 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:38,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-01-14 02:26:38,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:26:38,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:38,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:38,373 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:38,373 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:38,374 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 303#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 318#L551-3 main_#t~short9 := main_#t~short7; 317#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 316#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2019-01-14 02:26:38,374 INFO L796 eck$LassoCheckResult]: Loop: 313#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 307#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 308#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 298#L551-3 main_#t~short9 := main_#t~short7; 299#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 304#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2019-01-14 02:26:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-01-14 02:26:38,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:38,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2019-01-14 02:26:38,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:38,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:38,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2019-01-14 02:26:38,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:38,909 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-01-14 02:26:39,380 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 88 [2019-01-14 02:26:39,481 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:39,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:39,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:39,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:39,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:39,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:39,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:39,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:39,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:26:39,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:39,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:39,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:39,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:39,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:39,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:39,822 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-01-14 02:26:40,002 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:26:40,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:40,338 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-14 02:26:41,091 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:41,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:41,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:41,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:41,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:41,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:41,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,173 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:41,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:41,201 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:41,202 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:26:41,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:41,205 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:41,205 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:41,205 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2019-01-14 02:26:41,610 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:41,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:41,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:41,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:41,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:41,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:41,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:41,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:41,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:41,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-01-14 02:26:41,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:26:41,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:26:42,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:42,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-01-14 02:26:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:42,190 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:26:42,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:26:42,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 48 states and 58 transitions. Complement of second has 12 states. [2019-01-14 02:26:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:26:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 02:26:42,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2019-01-14 02:26:42,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2019-01-14 02:26:42,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2019-01-14 02:26:42,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2019-01-14 02:26:42,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:42,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2019-01-14 02:26:42,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:26:42,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 02:26:42,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2019-01-14 02:26:42,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:42,362 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-14 02:26:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2019-01-14 02:26:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-01-14 02:26:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 02:26:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-01-14 02:26:42,368 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-01-14 02:26:42,368 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-01-14 02:26:42,368 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:26:42,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2019-01-14 02:26:42,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:42,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:42,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:42,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:42,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:42,372 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 554#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 577#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 582#L551-3 main_#t~short9 := main_#t~short7; 581#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 580#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 579#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 578#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 559#L554-2 [2019-01-14 02:26:42,372 INFO L796 eck$LassoCheckResult]: Loop: 559#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 563#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 549#L551-3 main_#t~short9 := main_#t~short7; 550#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 555#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 558#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 559#L554-2 [2019-01-14 02:26:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2019-01-14 02:26:42,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-01-14 02:26:42,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:42,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2019-01-14 02:26:42,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:42,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:42,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,126 WARN L181 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-14 02:26:43,571 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2019-01-14 02:26:43,778 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:26:43,782 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:43,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:43,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:43,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:43,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:43,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:43,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:43,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:43,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:26:43,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:43,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:43,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:43,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:43,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:43,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:43,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,087 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-14 02:26:44,264 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:26:44,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:44,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:45,068 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:45,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:45,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:45,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,333 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:26:45,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,341 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:45,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:45,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:45,476 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:45,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:45,477 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:45,477 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:45,478 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 [] [2019-01-14 02:26:45,695 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:45,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:45,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:45,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:45,774 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 [2019-01-14 02:26:45,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:26:45,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 55 states and 66 transitions. Complement of second has 7 states. [2019-01-14 02:26:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:26:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:26:45,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:26:45,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:45,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:26:45,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:45,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-14 02:26:45,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:45,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2019-01-14 02:26:45,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:45,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2019-01-14 02:26:45,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 02:26:45,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 02:26:45,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2019-01-14 02:26:45,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:45,818 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-01-14 02:26:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2019-01-14 02:26:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-14 02:26:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:26:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-01-14 02:26:45,826 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-01-14 02:26:45,826 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-01-14 02:26:45,826 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:26:45,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2019-01-14 02:26:45,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:26:45,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:45,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:45,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:26:45,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:45,829 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 816#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 845#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 844#L551-3 main_#t~short9 := main_#t~short7; 843#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 842#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 841#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 840#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 831#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 838#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 837#L551-3 main_#t~short9 := main_#t~short7; 835#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 836#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 848#L552 [2019-01-14 02:26:45,829 INFO L796 eck$LassoCheckResult]: Loop: 848#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 858#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 855#L551-3 main_#t~short9 := main_#t~short7; 854#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 851#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 848#L552 [2019-01-14 02:26:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2019-01-14 02:26:45,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:45,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:45,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2019-01-14 02:26:45,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:45,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:45,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:45,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2019-01-14 02:26:45,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:45,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,239 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-01-14 02:26:46,927 WARN L181 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2019-01-14 02:26:47,036 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:47,036 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:47,036 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:47,036 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:47,036 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:47,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:47,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:47,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:47,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:26:47,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:47,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:47,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,438 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-01-14 02:26:47,562 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:26:47,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:47,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:48,348 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:48,447 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:48,448 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:48,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,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 [2019-01-14 02:26:48,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,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 [2019-01-14 02:26:48,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:48,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,516 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:48,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:48,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:48,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:48,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:48,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:48,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:48,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:48,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:48,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:48,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:48,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:48,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:48,584 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:48,585 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:48,585 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:48,586 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:48,586 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:48,586 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2019-01-14 02:26:49,260 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:49,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:26:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:26:49,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-01-14 02:26:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:49,415 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:26:49,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:26:49,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 74 states and 87 transitions. Complement of second has 9 states. [2019-01-14 02:26:49,460 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 [2019-01-14 02:26:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-14 02:26:49,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:49,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:49,461 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:26:49,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:26:49,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-01-14 02:26:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:49,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:26:49,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:26:49,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 72 states and 83 transitions. Complement of second has 11 states. [2019-01-14 02:26:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-14 02:26:49,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:49,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:49,667 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:49,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:26:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:49,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:26:49,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:49,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-01-14 02:26:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:49,784 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 4 loop predicates [2019-01-14 02:26:49,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:26:49,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 118 states and 142 transitions. Complement of second has 10 states. [2019-01-14 02:26:49,830 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 [2019-01-14 02:26:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:26:49,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:49,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:49,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2019-01-14 02:26:49,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:49,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2019-01-14 02:26:49,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:49,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2019-01-14 02:26:49,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-14 02:26:49,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2019-01-14 02:26:49,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-14 02:26:49,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-14 02:26:49,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2019-01-14 02:26:49,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:49,840 INFO L706 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-01-14 02:26:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2019-01-14 02:26:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2019-01-14 02:26:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 02:26:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-01-14 02:26:49,850 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-01-14 02:26:49,850 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-01-14 02:26:49,850 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:26:49,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2019-01-14 02:26:49,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-14 02:26:49,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:49,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:49,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:49,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2019-01-14 02:26:49,852 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1469#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1470#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1498#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1494#L551-3 main_#t~short9 := main_#t~short7; 1491#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1489#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 1486#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1487#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 1474#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1476#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1465#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2019-01-14 02:26:49,852 INFO L796 eck$LassoCheckResult]: Loop: 1466#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1471#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 1479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1480#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 1504#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1526#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1525#L551-3 main_#t~short9 := main_#t~short7; 1524#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1523#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 1522#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 1477#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1478#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1531#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2019-01-14 02:26:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2019-01-14 02:26:49,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:49,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2019-01-14 02:26:49,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2019-01-14 02:26:49,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:49,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:50,919 WARN L181 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-01-14 02:26:51,034 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-14 02:26:51,521 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 106 [2019-01-14 02:26:51,650 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-14 02:26:51,654 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:51,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:51,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:51,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:51,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:51,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:51,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:51,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:51,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-14 02:26:51,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:51,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:51,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:51,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,014 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-01-14 02:26:52,173 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-14 02:26:52,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:52,894 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:53,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:53,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:53,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:53,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,128 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:53,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:53,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:53,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:53,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:53,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:53,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:53,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:53,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,141 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:26:53,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,144 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:53,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:53,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:53,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:53,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:53,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:53,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:53,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:53,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:53,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:53,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:53,225 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:53,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:53,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:53,227 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:53,228 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)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2019-01-14 02:26:53,699 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:53,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:53,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:53,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:53,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:53,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:53,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2019-01-14 02:26:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-14 02:26:53,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:53,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2019-01-14 02:26:53,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:26:54,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-14 02:26:54,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:54,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-14 02:26:54,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:54,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,084 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 02:26:54,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:54,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,151 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:26:54,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:26:54,242 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2019-01-14 02:26:54,524 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-14 02:26:54,813 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-01-14 02:26:55,081 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 02:26:55,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2019-01-14 02:26:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:26:55,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-01-14 02:26:55,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-01-14 02:26:55,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2019-01-14 02:26:55,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2019-01-14 02:26:55,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-01-14 02:26:55,405 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 02:26:55,438 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,462 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:55,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-14 02:26:55,504 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2019-01-14 02:26:56,137 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-01-14 02:26:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:56,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-01-14 02:26:56,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2019-01-14 02:28:21,098 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-14 02:28:21,455 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-14 02:28:21,751 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-01-14 02:29:45,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 122 states and 143 transitions. Complement of second has 16 states. [2019-01-14 02:29:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-14 02:29:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:29:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2019-01-14 02:29:45,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 12 letters. Loop has 13 letters. [2019-01-14 02:29:45,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:45,899 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:29:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:45,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:45,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:45,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:29:45,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:45,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:45,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:29:45,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:45,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:45,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:45,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:29:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:45,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:46,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2019-01-14 02:29:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:46,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2019-01-14 02:29:46,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-14 02:29:46,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:46,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2019-01-14 02:29:46,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-14 02:29:46,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:29:46,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,239 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-14 02:29:46,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:29:46,267 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:46,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:46,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 61 [2019-01-14 02:29:46,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 02:29:46,367 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,498 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:46,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 02:29:46,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:29:46,566 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,573 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:46,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:29:46,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:29:46,641 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2019-01-14 02:29:46,823 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-14 02:29:46,967 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-01-14 02:29:47,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-01-14 02:29:47,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-01-14 02:29:47,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2019-01-14 02:29:47,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2019-01-14 02:29:47,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-01-14 02:29:47,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-14 02:29:47,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:47,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2019-01-14 02:29:47,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:47,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:29:47,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,341 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:47,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-14 02:29:47,380 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2019-01-14 02:29:47,712 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-01-14 02:29:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:47,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-01-14 02:29:47,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2019-01-14 02:31:01,559 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-14 02:31:01,807 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-14 02:31:02,013 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-14 02:32:14,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 109 states and 127 transitions. Complement of second has 22 states. [2019-01-14 02:32:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:32:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-14 02:32:14,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 21 transitions. Stem has 12 letters. Loop has 13 letters. [2019-01-14 02:32:14,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:14,087 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:14,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:14,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:14,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:14,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2019-01-14 02:32:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-14 02:32:14,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2019-01-14 02:32:14,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:32:14,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 61 [2019-01-14 02:32:14,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 02:32:14,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:14,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 02:32:14,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:14,640 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,664 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-14 02:32:14,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:14,718 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,729 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-14 02:32:14,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:14,744 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,755 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:32:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:14,816 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2019-01-14 02:32:14,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:32:14,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:14,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:14,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2019-01-14 02:32:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:32:14,926 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:32:14,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 7 states. [2019-01-14 02:32:15,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 141 states and 167 transitions. Complement of second has 12 states. [2019-01-14 02:32:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:32:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-14 02:32:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 13 letters. [2019-01-14 02:32:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 25 letters. Loop has 13 letters. [2019-01-14 02:32:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 26 letters. [2019-01-14 02:32:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:15,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 167 transitions. [2019-01-14 02:32:15,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-01-14 02:32:15,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 110 states and 130 transitions. [2019-01-14 02:32:15,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 02:32:15,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 02:32:15,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 130 transitions. [2019-01-14 02:32:15,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:15,016 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 130 transitions. [2019-01-14 02:32:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 130 transitions. [2019-01-14 02:32:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2019-01-14 02:32:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 02:32:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-01-14 02:32:15,022 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-14 02:32:15,022 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-14 02:32:15,022 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:32:15,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 112 transitions. [2019-01-14 02:32:15,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:32:15,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:15,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:15,024 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:32:15,024 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:15,024 INFO L794 eck$LassoCheckResult]: Stem: 2349#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2344#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2345#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2395#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2392#L551-3 main_#t~short9 := main_#t~short7; 2393#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2358#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 2350#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2351#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2362#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2359#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2340#L551-3 main_#t~short9 := main_#t~short7; 2341#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2347#L551-6 [2019-01-14 02:32:15,025 INFO L796 eck$LassoCheckResult]: Loop: 2347#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 2368#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2365#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2354#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2355#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2429#L551-3 main_#t~short9 := main_#t~short7; 2428#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2347#L551-6 [2019-01-14 02:32:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2019-01-14 02:32:15,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:15,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 1 times [2019-01-14 02:32:15,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1982470167, now seen corresponding path program 4 times [2019-01-14 02:32:15,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:15,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:15,388 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-01-14 02:32:15,586 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 02:32:16,238 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 120 [2019-01-14 02:32:17,181 WARN L181 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 101 [2019-01-14 02:32:17,185 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:17,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:17,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:17,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:17,186 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:17,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:17,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:17,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:17,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:32:17,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:17,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:17,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:17,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:17,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:17,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,126 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-01-14 02:32:18,323 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-14 02:32:18,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:18,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:19,505 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:32:19,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:19,625 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:19,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,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 [2019-01-14 02:32:19,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,639 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:19,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:19,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,642 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:19,642 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:19,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,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 [2019-01-14 02:32:19,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,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 [2019-01-14 02:32:19,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,743 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:19,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,748 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:19,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:19,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:19,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:19,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:19,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,825 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:32:19,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,827 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,827 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,831 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,832 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,834 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,834 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,838 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:19,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:19,838 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,842 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:19,843 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:32:19,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,878 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,879 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,879 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,885 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,886 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,886 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,891 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,891 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,894 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,894 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,900 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,905 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,905 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,911 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,911 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,919 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,919 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,921 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:19,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,921 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,925 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:19,925 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,949 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,950 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,964 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,964 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,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 [2019-01-14 02:32:19,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,980 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,982 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,982 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,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 [2019-01-14 02:32:19,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,985 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,985 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,991 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,993 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:19,993 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:19,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:19,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:19,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:19,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:19,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:19,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:19,998 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:19,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:19,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:19,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,001 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,001 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:20,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,003 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:20,003 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:20,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,006 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:32:20,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,008 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,008 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,012 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,012 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,016 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,017 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,021 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:20,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:20,021 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,026 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-01-14 02:32:20,026 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-14 02:32:20,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,074 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,077 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,077 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,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 [2019-01-14 02:32:20,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,085 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,085 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,093 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,097 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,098 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,101 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,102 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,102 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,113 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,113 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,120 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,120 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,130 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,130 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,134 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:20,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,152 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-01-14 02:32:20,152 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,188 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,188 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,208 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,208 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,211 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,211 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,219 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,222 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,222 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,228 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,228 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,233 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,233 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,235 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,235 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:20,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:20,241 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:20,241 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:20,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,244 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:32:20,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,245 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,246 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,247 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,250 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,251 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,251 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,254 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,255 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,256 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,260 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:20,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:20,260 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,267 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-01-14 02:32:20,268 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2019-01-14 02:32:20,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,322 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,323 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,323 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,336 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,343 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,343 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,356 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,356 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,360 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,362 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,362 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,378 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,383 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,383 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,399 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,403 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,403 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,421 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,422 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,422 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,437 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:20,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,437 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,443 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-01-14 02:32:20,443 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,487 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,488 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,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 [2019-01-14 02:32:20,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,727 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,728 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,728 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,734 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,734 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,739 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,744 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,748 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,755 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,756 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,756 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,760 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,767 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,767 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,772 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,773 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:20,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,774 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:20,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:20,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:20,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:20,777 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:20,777 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:20,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,781 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:32:20,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:20,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:20,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,782 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,783 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:20,783 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:20,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:20,786 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:20,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,787 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:20,787 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:20,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:20,790 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:20,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:20,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:20,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,797 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:20,797 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:20,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:20,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:20,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:20,801 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:20,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:20,802 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:20,802 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:20,813 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:20,813 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:32:20,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:21,058 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:32:21,058 INFO L444 ModelExtractionUtils]: 19 out of 34 variables were initially zero. Simplification set additionally 11 variables to zero. [2019-01-14 02:32:21,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:21,061 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-14 02:32:21,062 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:21,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_6 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_6 Supporting invariants [] [2019-01-14 02:32:21,375 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:32:21,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:21,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:21,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:21,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:21,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:21,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:21,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:21,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:21,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:21,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:21,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:21,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:21,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2019-01-14 02:32:21,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:32:21,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 02:32:21,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:21,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:21,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:21,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:21,942 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:21,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:21,961 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,967 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:22,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:32:22,015 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2019-01-14 02:32:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:22,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:32:22,071 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 5 states. [2019-01-14 02:32:22,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 196 states and 234 transitions. Complement of second has 8 states. [2019-01-14 02:32:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:32:22,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2019-01-14 02:32:22,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-01-14 02:32:22,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 14 letters. [2019-01-14 02:32:22,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 234 transitions. [2019-01-14 02:32:22,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:32:22,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 175 states and 210 transitions. [2019-01-14 02:32:22,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 02:32:22,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 02:32:22,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 210 transitions. [2019-01-14 02:32:22,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:22,214 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 210 transitions. [2019-01-14 02:32:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 210 transitions. [2019-01-14 02:32:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2019-01-14 02:32:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-14 02:32:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2019-01-14 02:32:22,224 INFO L729 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2019-01-14 02:32:22,224 INFO L609 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2019-01-14 02:32:22,224 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:32:22,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 194 transitions. [2019-01-14 02:32:22,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:32:22,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:22,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:22,226 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:32:22,226 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:22,226 INFO L794 eck$LassoCheckResult]: Stem: 2825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2819#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2820#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2866#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2872#L551-3 main_#t~short9 := main_#t~short7; 2870#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2838#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 2839#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2922#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2883#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2885#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2875#L551-3 main_#t~short9 := main_#t~short7; 2876#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2867#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 2869#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2886#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2834#L554-2 [2019-01-14 02:32:22,226 INFO L796 eck$LassoCheckResult]: Loop: 2834#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2835#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2977#L551-3 main_#t~short9 := main_#t~short7; 2826#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2827#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 2848#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2849#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2834#L554-2 [2019-01-14 02:32:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash -996537471, now seen corresponding path program 1 times [2019-01-14 02:32:22,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -334846251, now seen corresponding path program 2 times [2019-01-14 02:32:22,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1135913813, now seen corresponding path program 2 times [2019-01-14 02:32:22,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:22,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,642 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-01-14 02:32:23,492 WARN L181 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 128 [2019-01-14 02:32:23,792 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:32:23,798 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:23,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:23,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:23,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:23,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:23,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:23,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:23,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:23,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2019-01-14 02:32:23,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:23,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:23,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:23,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,177 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-01-14 02:32:24,313 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:32:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,906 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:32:25,356 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:32:25,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:25,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:25,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 [2019-01-14 02:32:25,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,454 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:25,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:25,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,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 [2019-01-14 02:32:25,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,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 [2019-01-14 02:32:25,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:25,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:25,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:25,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:25,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:25,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:25,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:25,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:25,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:25,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:25,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:25,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:25,600 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:32:25,600 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:32:25,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:25,601 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:25,602 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:25,602 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)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2019-01-14 02:32:25,835 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:32:25,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:25,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:25,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:25,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:26,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:32:26,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46 Second operand 7 states. [2019-01-14 02:32:26,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46. Second operand 7 states. Result 249 states and 297 transitions. Complement of second has 12 states. [2019-01-14 02:32:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:32:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-01-14 02:32:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 7 letters. [2019-01-14 02:32:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 23 letters. Loop has 7 letters. [2019-01-14 02:32:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 14 letters. [2019-01-14 02:32:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:26,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 297 transitions. [2019-01-14 02:32:26,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:32:26,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 219 states and 261 transitions. [2019-01-14 02:32:26,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-14 02:32:26,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-01-14 02:32:26,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 261 transitions. [2019-01-14 02:32:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:26,165 INFO L706 BuchiCegarLoop]: Abstraction has 219 states and 261 transitions. [2019-01-14 02:32:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 261 transitions. [2019-01-14 02:32:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2019-01-14 02:32:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-14 02:32:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2019-01-14 02:32:26,177 INFO L729 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2019-01-14 02:32:26,177 INFO L609 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2019-01-14 02:32:26,177 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:32:26,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 242 transitions. [2019-01-14 02:32:26,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-14 02:32:26,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:26,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:26,180 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 02:32:26,180 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:26,180 INFO L794 eck$LassoCheckResult]: Stem: 3438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3432#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3433#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3476#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3506#L551-3 main_#t~short9 := main_#t~short7; 3505#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3451#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 3453#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3448#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 3578#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3576#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3434#L551-3 main_#t~short9 := main_#t~short7; 3435#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3550#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 3512#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3513#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3572#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3454#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3455#L551-3 main_#t~short9 := main_#t~short7; 3631#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3515#L551-6 [2019-01-14 02:32:26,180 INFO L796 eck$LassoCheckResult]: Loop: 3515#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 3460#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3461#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3458#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3620#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3619#L551-3 main_#t~short9 := main_#t~short7; 3618#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3515#L551-6 [2019-01-14 02:32:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331691, now seen corresponding path program 3 times [2019-01-14 02:32:26,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:26,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:26,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 2 times [2019-01-14 02:32:26,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:26,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash 742589689, now seen corresponding path program 4 times [2019-01-14 02:32:26,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:26,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:27,270 WARN L181 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-01-14 02:32:27,473 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 02:32:28,795 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 221 DAG size of output: 148 [2019-01-14 02:32:29,944 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2019-01-14 02:32:29,949 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:29,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:29,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:29,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:29,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:29,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:29,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:29,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:29,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2019-01-14 02:32:29,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:29,950 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:29,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:31,588 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-01-14 02:32:31,831 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-14 02:32:31,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:31,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:33,200 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:32:33,221 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:33,222 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:33,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,343 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:33,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:33,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,347 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:33,347 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,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 [2019-01-14 02:32:33,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,382 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:33,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,385 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:33,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:33,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:33,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:33,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:33,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,403 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:32:33,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,404 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,405 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,405 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,410 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,410 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,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 [2019-01-14 02:32:33,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,413 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,414 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,417 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,417 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,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 [2019-01-14 02:32:33,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,419 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,426 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,429 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,429 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,436 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,438 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,441 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,441 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,446 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,447 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,447 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,455 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,456 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,470 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,470 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,473 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,474 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,474 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,479 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:33,479 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:33,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,486 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:33,486 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:32:33,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,547 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,548 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,548 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,554 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,554 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,555 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,562 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:33,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,562 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,569 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:33,572 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,606 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,606 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:33,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,608 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:33,608 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:33,608 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:33,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,611 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:32:33,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,613 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,613 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,618 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,618 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,621 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,621 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,631 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,631 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,651 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,656 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,656 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,672 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,673 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,673 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,684 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,689 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,709 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,709 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,745 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,745 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,751 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,752 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,752 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,765 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:33,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:33,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,775 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-01-14 02:32:33,775 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-14 02:32:33,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,866 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,867 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,884 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,884 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,899 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:33,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,910 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-01-14 02:32:33,910 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:33,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:32:33,958 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:33,958 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:33,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,961 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:32:33,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,964 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:33,965 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:33,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,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 [2019-01-14 02:32:33,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,971 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:33,971 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:33,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,975 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:33,975 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:33,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,981 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:33,981 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:33,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,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 [2019-01-14 02:32:33,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,984 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:33,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:33,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,992 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:33,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:33,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,996 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:33,997 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:33,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:33,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:33,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:33,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:33,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:33,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:33,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,003 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,003 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,012 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:34,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,019 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:34,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,023 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,026 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,043 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,048 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,048 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,072 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,073 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,094 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,094 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,098 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,099 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,106 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:34,106 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:34,106 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,113 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-01-14 02:32:34,114 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2019-01-14 02:32:34,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,173 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,174 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,174 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,185 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,191 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,191 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,204 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:34,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,215 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-01-14 02:32:34,215 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,269 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:32:34,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,271 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:32:34,272 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:32:34,272 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:32:34,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,275 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:32:34,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,276 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,276 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,277 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,277 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,282 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,283 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,286 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,287 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,290 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,291 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,291 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,295 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,297 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,297 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,297 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,299 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,299 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,300 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,301 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,302 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,310 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,310 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,311 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,311 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,314 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,314 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,315 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:32:34,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,319 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,320 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,320 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,325 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,326 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,327 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,327 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,333 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,334 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,337 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,337 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,359 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,360 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,360 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,363 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,364 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:32:34,364 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:32:34,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:32:34,369 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:32:34,369 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:34,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:34,370 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:32:34,377 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:32:34,377 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:32:34,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:34,762 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:32:34,763 INFO L444 ModelExtractionUtils]: 15 out of 34 variables were initially zero. Simplification set additionally 15 variables to zero. [2019-01-14 02:32:34,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:34,764 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-14 02:32:34,765 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:34,765 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [] [2019-01-14 02:32:35,388 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:32:35,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:35,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:35,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:35,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:35,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:35,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:35,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2019-01-14 02:32:35,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:32:35,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 02:32:35,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:35,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:35,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:35,833 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:35,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:35,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,880 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:35,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:35,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:35,932 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:35,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:35,951 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,958 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:35,968 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:32:36,009 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2019-01-14 02:32:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:36,066 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:32:36,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:32:36,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 8 states. [2019-01-14 02:32:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:32:36,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-01-14 02:32:36,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:36,296 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:36,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:36,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:36,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:36,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:36,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:36,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:36,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:36,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:36,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:36,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:36,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:36,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:36,743 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,751 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:36,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2019-01-14 02:32:36,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:36,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:32:36,884 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,040 INFO L303 Elim1Store]: Index analysis took 142 ms [2019-01-14 02:32:37,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 02:32:37,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:37,043 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,054 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,067 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:32:37,108 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2019-01-14 02:32:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:37,183 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:32:37,183 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:32:37,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 8 states. [2019-01-14 02:32:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:32:37,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-01-14 02:32:37,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:37,342 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:37,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:37,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:37,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:37,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:37,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:37,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2019-01-14 02:32:37,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:32:37,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 02:32:37,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:37,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:37,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:37,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:37,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:37,787 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,794 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2019-01-14 02:32:37,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:37,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:37,861 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:37,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:37,881 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,886 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,894 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:37,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:32:37,934 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2019-01-14 02:32:38,769 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-01-14 02:32:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:38,776 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:32:38,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:32:39,379 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-14 02:32:40,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 411 states and 491 transitions. Complement of second has 9 states. [2019-01-14 02:32:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-01-14 02:32:40,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2019-01-14 02:32:40,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2019-01-14 02:32:40,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2019-01-14 02:32:40,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 491 transitions. [2019-01-14 02:32:40,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-14 02:32:40,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 255 states and 305 transitions. [2019-01-14 02:32:40,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 02:32:40,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-14 02:32:40,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 305 transitions. [2019-01-14 02:32:40,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:40,241 INFO L706 BuchiCegarLoop]: Abstraction has 255 states and 305 transitions. [2019-01-14 02:32:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 305 transitions. [2019-01-14 02:32:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2019-01-14 02:32:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-14 02:32:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2019-01-14 02:32:40,278 INFO L729 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2019-01-14 02:32:40,278 INFO L609 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2019-01-14 02:32:40,278 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:32:40,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 274 transitions. [2019-01-14 02:32:40,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2019-01-14 02:32:40,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:40,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:40,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-01-14 02:32:40,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:40,284 INFO L794 eck$LassoCheckResult]: Stem: 5056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5050#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5051#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5132#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5130#L551-3 main_#t~short9 := main_#t~short7; 5126#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5123#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 5070#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5174#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5170#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5166#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5167#L551-3 main_#t~short9 := main_#t~short7; 5198#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5196#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 5194#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5193#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5179#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5180#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5231#L551-3 main_#t~short9 := main_#t~short7; 5082#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5083#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 5065#L552 [2019-01-14 02:32:40,284 INFO L796 eck$LassoCheckResult]: Loop: 5065#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5066#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5092#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5091#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5089#L551-3 main_#t~short9 := main_#t~short7; 5090#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5244#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 5065#L552 [2019-01-14 02:32:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 5 times [2019-01-14 02:32:40,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:40,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:40,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:40,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash -745311761, now seen corresponding path program 3 times [2019-01-14 02:32:40,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1488185602, now seen corresponding path program 6 times [2019-01-14 02:32:40,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:40,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:40,742 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-01-14 02:32:41,808 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 221 DAG size of output: 148 [2019-01-14 02:32:41,976 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-14 02:32:41,980 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:41,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:41,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:41,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:41,980 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:41,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:41,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:41,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:41,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2019-01-14 02:32:41,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:41,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:41,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,425 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-01-14 02:32:42,555 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:32:42,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:42,814 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:32:43,464 WARN L181 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:32:43,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:43,646 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:43,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,652 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:43,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:43,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,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 [2019-01-14 02:32:43,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,701 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:43,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,705 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:43,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:43,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:43,780 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:32:43,780 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:32:43,780 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:43,781 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:43,781 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:43,781 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)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2019-01-14 02:32:44,339 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:32:44,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:44,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:44,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:44,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:44,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:44,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-01-14 02:32:44,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:44,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:44,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:44,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:44,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-01-14 02:32:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:44,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:32:44,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2019-01-14 02:32:44,905 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 339 states and 408 transitions. Complement of second has 12 states. [2019-01-14 02:32:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:32:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-01-14 02:32:44,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-01-14 02:32:44,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:44,909 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:44,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:44,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:44,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:44,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:44,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:45,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:45,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-01-14 02:32:45,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:45,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:45,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:45,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-01-14 02:32:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:45,201 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:32:45,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2019-01-14 02:32:45,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 347 states and 415 transitions. Complement of second has 14 states. [2019-01-14 02:32:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:32:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-14 02:32:45,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-01-14 02:32:45,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:45,359 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:45,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:45,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:45,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:45,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:32:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:45,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-01-14 02:32:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:45,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:45,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:45,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:45,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:45,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-01-14 02:32:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:45,675 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:32:45,675 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2019-01-14 02:32:45,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 538 states and 658 transitions. Complement of second has 14 states. [2019-01-14 02:32:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:32:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2019-01-14 02:32:45,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 7 letters. [2019-01-14 02:32:45,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:45,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 28 letters. Loop has 7 letters. [2019-01-14 02:32:45,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:45,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 14 letters. [2019-01-14 02:32:45,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:45,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 658 transitions. [2019-01-14 02:32:45,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2019-01-14 02:32:45,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 329 states and 391 transitions. [2019-01-14 02:32:45,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:32:45,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:32:45,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 391 transitions. [2019-01-14 02:32:45,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:45,853 INFO L706 BuchiCegarLoop]: Abstraction has 329 states and 391 transitions. [2019-01-14 02:32:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 391 transitions. [2019-01-14 02:32:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 266. [2019-01-14 02:32:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 02:32:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2019-01-14 02:32:45,870 INFO L729 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2019-01-14 02:32:45,870 INFO L609 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2019-01-14 02:32:45,870 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:32:45,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 323 transitions. [2019-01-14 02:32:45,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-01-14 02:32:45,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:45,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:45,876 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-01-14 02:32:45,876 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2019-01-14 02:32:45,876 INFO L794 eck$LassoCheckResult]: Stem: 6950#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6944#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6945#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6955#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6940#L551-3 main_#t~short9 := main_#t~short7; 6941#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6959#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 6961#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6990#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 6991#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7000#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7038#L551-3 main_#t~short9 := main_#t~short7; 7029#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7028#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 7027#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6980#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 6981#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7140#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7141#L551-3 main_#t~short9 := main_#t~short7; 7110#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6968#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 6970#L552 [2019-01-14 02:32:45,876 INFO L796 eck$LassoCheckResult]: Loop: 6970#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7107#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 7106#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7105#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7104#L551-3 main_#t~short9 := main_#t~short7; 7103#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7101#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 6969#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6982#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 7026#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7143#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7138#L551-3 main_#t~short9 := main_#t~short7; 7139#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6968#L551-6 assume !!main_#t~short9;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem8; 6970#L552 [2019-01-14 02:32:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 7 times [2019-01-14 02:32:45,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1613777279, now seen corresponding path program 1 times [2019-01-14 02:32:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash 950159116, now seen corresponding path program 8 times [2019-01-14 02:32:45,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:45,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:45,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:46,510 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2019-01-14 02:32:47,640 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 221 DAG size of output: 145 [2019-01-14 02:32:47,818 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-14 02:32:47,822 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:47,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:47,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:47,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:47,823 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:47,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:47,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:47,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:47,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration11_Lasso [2019-01-14 02:32:47,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:47,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:47,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:47,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:48,186 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-01-14 02:32:48,349 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-14 02:32:49,344 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:32:49,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:49,361 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:49,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,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 [2019-01-14 02:32:49,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,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 [2019-01-14 02:32:49,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:49,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,413 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:49,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,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 [2019-01-14 02:32:49,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:49,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:49,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:49,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:49,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:49,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:49,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:49,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:49,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:49,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:49,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:49,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:49,461 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:32:49,461 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:32:49,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:49,462 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:49,462 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:49,462 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)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2019-01-14 02:32:50,230 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:32:50,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:50,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:50,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:50,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:32:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:50,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:50,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:32:50,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:32:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:50,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:50,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:50,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-01-14 02:32:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:50,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2019-01-14 02:32:50,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 02:32:50,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:50,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:50,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:18 [2019-01-14 02:32:51,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:51,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 02:32:51,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:51,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:32:51,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:51,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 02:32:51,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:32:51,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:51,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:51,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:51,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:51,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2019-01-14 02:32:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:32:51,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:32:51,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74 Second operand 8 states. [2019-01-14 02:32:51,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74. Second operand 8 states. Result 632 states and 767 transitions. Complement of second has 11 states. [2019-01-14 02:32:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:32:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 02:32:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2019-01-14 02:32:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2019-01-14 02:32:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:51,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2019-01-14 02:32:51,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:51,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 632 states and 767 transitions. [2019-01-14 02:32:51,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:51,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 632 states to 0 states and 0 transitions. [2019-01-14 02:32:51,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:51,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:51,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:51,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:51,372 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:51,372 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:51,372 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:51,372 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:32:51,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:51,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:51,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:51 BoogieIcfgContainer [2019-01-14 02:32:51,388 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:51,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:51,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:51,388 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:51,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:33" (3/4) ... [2019-01-14 02:32:51,399 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:51,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:51,400 INFO L168 Benchmark]: Toolchain (without parser) took 379274.52 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 696.8 MB). Free memory was 946.0 MB in the beginning and 939.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 703.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:51,404 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:51,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 924.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:51,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -209.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:51,405 INFO L168 Benchmark]: Boogie Preprocessor took 25.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:51,405 INFO L168 Benchmark]: RCFGBuilder took 435.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:51,405 INFO L168 Benchmark]: BuchiAutomizer took 378099.96 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 549.5 MB). Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 176.7 MB). Peak memory consumption was 726.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:51,406 INFO L168 Benchmark]: Witness Printer took 11.25 ms. Allocated memory is still 1.7 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:51,411 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 924.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -209.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 378099.96 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 549.5 MB). Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 176.7 MB). Peak memory consumption was 726.2 MB. Max. memory is 11.5 GB. * Witness Printer took 11.25 ms. Allocated memory is still 1.7 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 - 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 - 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 11 terminating modules (1 trivial, 6 deterministic, 4 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[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 378.0s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 45.9s. Construction of modules took 314.4s. Büchi inclusion checks took 17.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 174 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 10. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/13 HoareTripleCheckerStatistics: 181 SDtfs, 357 SDslu, 127 SDs, 0 SdLazy, 542 SolverSat, 131 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 314.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital438 mio100 ax105 hnf99 lsp83 ukn63 mio100 lsp34 div100 bol101 ite100 ukn100 eq189 hnf88 smp98 dnf297 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 10 MotzkinApplications: 50 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...