./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/NoriSharma-2013FSE-Fig8-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 2618f63f0acd986074ff563fe806d4dc698d3d84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:44:47,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:44:47,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:44:47,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:44:47,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:44:47,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:44:47,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:44:47,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:44:47,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:44:47,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:44:47,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:44:47,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:44:47,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:44:47,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:44:47,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:44:47,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:44:47,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:44:47,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:44:47,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:44:47,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:44:47,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:44:47,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:44:47,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:44:47,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:44:47,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:44:47,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:44:47,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:44:47,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:44:47,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:44:47,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:44:47,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:44:47,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:44:47,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:44:47,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:44:47,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:44:47,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:44:47,908 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:44:47,924 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:44:47,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:44:47,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:44:47,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:44:47,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:44:47,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:44:47,926 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:44:47,926 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:44:47,927 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:44:47,927 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:44:47,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:44:47,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:44:47,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:44:47,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:44:47,928 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:44:47,929 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:44:47,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:44:47,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:44:47,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:44:47,929 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:44:47,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:44:47,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:44:47,930 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:44:47,931 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:44:47,931 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 -> 2618f63f0acd986074ff563fe806d4dc698d3d84 [2019-01-01 21:44:47,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:44:47,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:44:48,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:44:48,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:44:48,004 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:44:48,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2019-01-01 21:44:48,066 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c53ccc/d362d64484f04902b5682d3ae7863c38/FLAGd567bc10c [2019-01-01 21:44:48,550 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:44:48,551 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2019-01-01 21:44:48,569 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c53ccc/d362d64484f04902b5682d3ae7863c38/FLAGd567bc10c [2019-01-01 21:44:48,875 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c53ccc/d362d64484f04902b5682d3ae7863c38 [2019-01-01 21:44:48,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:44:48,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:44:48,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:48,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:44:48,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:44:48,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:48" (1/1) ... [2019-01-01 21:44:48,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713bbc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:48, skipping insertion in model container [2019-01-01 21:44:48,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:48" (1/1) ... [2019-01-01 21:44:48,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:44:48,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:44:49,260 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:49,277 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:44:49,475 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:49,543 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:44:49,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49 WrapperNode [2019-01-01 21:44:49,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:49,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:49,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:44:49,547 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:44:49,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:49,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:44:49,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:44:49,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:44:49,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (1/1) ... [2019-01-01 21:44:49,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:44:49,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:44:49,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:44:49,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:44:49,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (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-01 21:44:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:44:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:44:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:44:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:44:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:44:49,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:44:50,147 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:44:50,148 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:44:50,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:50 BoogieIcfgContainer [2019-01-01 21:44:50,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:44:50,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:44:50,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:44:50,153 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:44:50,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:50,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:44:48" (1/3) ... [2019-01-01 21:44:50,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@770c4ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:50, skipping insertion in model container [2019-01-01 21:44:50,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:50,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:49" (2/3) ... [2019-01-01 21:44:50,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@770c4ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:50, skipping insertion in model container [2019-01-01 21:44:50,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:50,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:50" (3/3) ... [2019-01-01 21:44:50,158 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2019-01-01 21:44:50,224 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:44:50,225 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:44:50,225 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:44:50,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:44:50,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:44:50,226 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:44:50,226 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:44:50,226 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:44:50,226 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:44:50,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:44:50,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:44:50,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:50,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:50,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:50,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:44:50,267 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:44:50,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:44:50,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:44:50,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:50,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:50,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:50,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:44:50,278 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 4#L560-2true [2019-01-01 21:44:50,278 INFO L796 eck$LassoCheckResult]: Loop: 4#L560-2true call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 6#L558-1true assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 10#L560true assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 4#L560-2true [2019-01-01 21:44:50,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:44:50,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2019-01-01 21:44:50,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:50,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:50,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:50,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-01 21:44:50,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:51,172 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:44:51,425 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 21:44:53,986 WARN L181 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-01-01 21:44:55,110 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 153 [2019-01-01 21:44:55,132 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:44:55,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:44:55,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:44:55,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:44:55,134 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:44:55,134 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:44:55,134 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:44:55,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:44:55,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:44:55,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:44:55,135 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:44:55,172 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-01 21:44:55,204 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-01 21:44:55,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-01 21:44:55,212 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-01 21:44:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:55,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:55,226 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-01 21:44:55,228 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-01 21:44:55,235 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-01 21:44:55,237 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-01 21:44:55,248 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-01 21:44:55,250 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-01 21:44:55,253 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-01 21:44:55,256 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-01 21:44:55,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:55,263 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-01 21:44:57,249 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 127 [2019-01-01 21:44:57,644 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-01 21:44:57,645 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-01 21:44:57,653 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-01 21:44:57,656 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-01 21:44:58,211 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-01 21:44:58,381 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:45:23,755 WARN L181 SmtUtils]: Spent 25.22 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:45:23,948 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 21:45:24,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:45:24,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:45:24,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-01 21:45:24,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:24,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:24,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:24,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,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-01 21:45:24,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:24,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:24,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:24,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:24,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:24,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:24,353 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-01 21:45:24,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:24,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:24,500 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-01 21:45:24,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:25,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:25,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:25,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:25,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:25,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:25,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,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-01 21:45:25,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:25,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:25,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:25,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,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-01 21:45:25,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:25,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:25,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:25,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:25,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:25,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:25,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:25,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:25,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:25,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:25,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:25,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:25,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:25,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:45:25,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:45:25,348 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:45:25,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:45:25,351 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:45:25,351 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:45:25,352 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, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 1 Supporting invariants [] [2019-01-01 21:45:27,335 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-01 21:45:27,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:27,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:27,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:27,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:27,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:27,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:27,851 INFO L303 Elim1Store]: Index analysis took 252 ms [2019-01-01 21:45:28,060 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 48 treesize of output 74 [2019-01-01 21:45:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:28,105 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 65 treesize of output 58 [2019-01-01 21:45:28,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:28,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:28,219 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 60 [2019-01-01 21:45:28,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:45:28,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:45:28,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:45:28,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-01 21:45:29,010 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-01 21:45:29,012 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-01 21:45:29,027 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-01 21:45:29,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-01 21:45:29,231 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 10 states. [2019-01-01 21:45:29,232 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-01 21:45:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:45:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-01 21:45:29,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:45:29,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:29,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:45:29,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:29,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:45:29,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:29,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-01 21:45:29,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:45:29,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 14 transitions. [2019-01-01 21:45:29,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:45:29,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:45:29,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 21:45:29,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:45:29,255 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:45:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 21:45:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:45:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:45:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:45:29,281 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:45:29,281 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:45:29,281 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:45:29,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 21:45:29,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:45:29,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:45:29,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:45:29,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:45:29,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:45:29,283 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 546#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 547#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 552#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 554#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 548#L560-2 [2019-01-01 21:45:29,283 INFO L796 eck$LassoCheckResult]: Loop: 548#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 549#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 556#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 548#L560-2 [2019-01-01 21:45:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-01-01 21:45:29,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:29,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2019-01-01 21:45:29,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:29,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-01-01 21:45:29,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:45:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:30,049 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:45:30,428 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 21:45:33,513 WARN L181 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 211 DAG size of output: 181 [2019-01-01 21:45:35,025 WARN L181 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 166 [2019-01-01 21:45:35,030 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:45:35,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:45:35,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:45:35,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:45:35,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:45:35,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:45:35,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:45:35,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:45:35,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:45:35,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:45:35,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:45:35,039 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-01 21:45:35,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-01 21:45:35,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:35,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-01 21:45:35,064 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-01 21:45:35,066 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-01 21:45:35,068 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-01 21:45:35,070 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-01 21:45:35,072 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-01 21:45:35,075 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-01 21:45:37,583 WARN L181 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 137 [2019-01-01 21:45:37,927 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-01 21:45:37,927 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-01 21:45:37,930 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-01 21:45:37,931 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-01 21:45:37,933 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-01 21:45:37,935 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-01 21:45:37,937 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-01 21:45:37,940 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-01 21:45:37,943 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-01 21:45:37,946 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-01 21:45:37,948 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-01 21:45:38,324 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:45:38,610 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-01 21:45:38,724 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:46:03,578 WARN L181 SmtUtils]: Spent 24.71 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:46:03,736 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 21:46:03,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:03,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:03,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,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-01 21:46:03,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,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-01 21:46:03,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:04,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:04,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:04,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:04,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:04,044 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:46:04,045 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:46:04,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:04,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:04,049 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:04,049 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, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 1 Supporting invariants [] [2019-01-01 21:46:06,381 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-01 21:46:06,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:06,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:06,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:06,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-01-01 21:46:06,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-01-01 21:46:06,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-01 21:46:06,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2019-01-01 21:46:06,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-01 21:46:06,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2019-01-01 21:46:06,806 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:07,000 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-01 21:46:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:07,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:07,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,203 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 48 treesize of output 74 [2019-01-01 21:46:07,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,210 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 65 treesize of output 58 [2019-01-01 21:46:07,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:07,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,360 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 60 [2019-01-01 21:46:07,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:07,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:07,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:07,450 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-01 21:46:07,550 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-01 21:46:07,550 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-01 21:46:07,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-01 21:46:07,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 17 states and 22 transitions. Complement of second has 8 states. [2019-01-01 21:46:07,663 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-01 21:46:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-01 21:46:07,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:46:07,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:07,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:46:07,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:07,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:46:07,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:07,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-01 21:46:07,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:07,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-01-01 21:46:07,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:46:07,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:46:07,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-01 21:46:07,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:07,670 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:46:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-01 21:46:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 21:46:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:46:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-01 21:46:07,673 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:46:07,673 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:46:07,673 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:46:07,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-01 21:46:07,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:07,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:07,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:07,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2019-01-01 21:46:07,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:07,675 INFO L794 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1095#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1096#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1108#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1106#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1105#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1101#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1103#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1097#L560-2 [2019-01-01 21:46:07,675 INFO L796 eck$LassoCheckResult]: Loop: 1097#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1098#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1107#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 1097#L560-2 [2019-01-01 21:46:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash 179493187, now seen corresponding path program 2 times [2019-01-01 21:46:07,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:07,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 3 times [2019-01-01 21:46:07,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:07,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 47257513, now seen corresponding path program 2 times [2019-01-01 21:46:07,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:08,430 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:46:08,586 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 21:46:17,873 WARN L181 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 242 DAG size of output: 210 [2019-01-01 21:46:21,433 WARN L181 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 181 [2019-01-01 21:46:21,439 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:21,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:21,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:21,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:21,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:21,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:21,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:21,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:21,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:46:21,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:21,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:21,446 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-01 21:46:21,452 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-01 21:46:21,454 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-01 21:46:21,496 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-01 21:46:21,509 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-01 21:46:21,511 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-01 21:46:21,512 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-01 21:46:21,514 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-01 21:46:21,515 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-01 21:46:21,517 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-01 21:46:21,521 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-01 21:46:21,523 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-01 21:46:21,524 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-01 21:46:21,527 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-01 21:46:21,528 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-01 21:46:21,530 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-01 21:46:25,636 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-01 21:46:25,969 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-01 21:46:25,970 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-01 21:46:25,973 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-01 21:46:25,974 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-01 21:46:25,976 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-01 21:46:26,187 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:46:26,565 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-01 21:46:26,656 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:46:52,324 WARN L181 SmtUtils]: Spent 25.56 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:46:52,626 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:46:52,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:52,726 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:52,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-01 21:46:52,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:52,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:52,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:52,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,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-01 21:46:52,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:52,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:52,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:52,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:52,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:52,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:52,858 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-01 21:46:52,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:52,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:52,936 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-01 21:46:52,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:53,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-01 21:46:53,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:53,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:53,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:53,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:53,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:53,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:53,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:53,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:53,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:53,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:53,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:53,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:53,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:53,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:53,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:53,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:53,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:53,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:53,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:53,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:53,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-01 21:46:53,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:53,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:53,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:53,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:53,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:53,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:53,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-01 21:46:53,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:53,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:53,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:53,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:53,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:53,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:53,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:53,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:53,475 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:46:53,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:53,479 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:53,482 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:53,482 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, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 + 1 Supporting invariants [] [2019-01-01 21:46:55,271 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-01 21:46:55,457 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:46:55,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:55,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:55,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:55,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-01-01 21:46:55,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-01-01 21:46:55,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-01 21:46:55,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2019-01-01 21:46:55,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-01 21:46:55,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:55,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2019-01-01 21:46:55,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:55,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-01 21:46:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:55,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:56,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,135 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 48 treesize of output 74 [2019-01-01 21:46:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,156 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 65 treesize of output 58 [2019-01-01 21:46:56,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:56,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,217 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 60 [2019-01-01 21:46:56,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:56,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:56,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:56,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-01 21:46:56,407 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-01 21:46:56,407 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-01 21:46:56,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:46:56,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 21 states and 28 transitions. Complement of second has 8 states. [2019-01-01 21:46:56,513 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-01 21:46:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-01 21:46:56,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:46:56,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:56,515 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:56,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-01-01 21:46:56,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-01-01 21:46:56,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-01 21:46:56,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2019-01-01 21:46:56,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,800 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-01-01 21:46:56,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-01 21:46:56,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:56,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2019-01-01 21:46:56,884 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:56,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:56,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:56,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:56,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:57,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:57,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:57,069 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-01 21:46:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:57,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:57,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,165 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 48 treesize of output 74 [2019-01-01 21:46:57,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,172 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 65 treesize of output 58 [2019-01-01 21:46:57,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:57,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,233 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 60 [2019-01-01 21:46:57,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:57,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:57,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:57,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-01 21:46:57,435 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-01 21:46:57,435 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-01 21:46:57,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:46:57,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 21 states and 28 transitions. Complement of second has 8 states. [2019-01-01 21:46:57,541 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-01 21:46:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-01 21:46:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:46:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:57,543 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:57,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:57,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-01-01 21:46:57,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-01-01 21:46:57,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-01 21:46:57,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2019-01-01 21:46:57,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-01 21:46:57,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:57,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2019-01-01 21:46:57,972 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,239 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-01 21:46:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:58,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:58,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:58,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:58,338 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 48 treesize of output 74 [2019-01-01 21:46:58,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:58,348 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 65 treesize of output 58 [2019-01-01 21:46:58,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:58,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:58,422 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 60 [2019-01-01 21:46:58,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:58,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:58,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:58,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-01 21:46:58,636 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-01 21:46:58,636 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-01 21:46:58,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:46:58,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 24 states and 32 transitions. Complement of second has 7 states. [2019-01-01 21:46:58,740 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-01 21:46:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:46:58,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:46:58,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:58,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 21:46:58,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:58,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:46:58,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:58,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2019-01-01 21:46:58,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:46:58,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 26 transitions. [2019-01-01 21:46:58,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:46:58,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:46:58,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-01 21:46:58,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:58,746 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 21:46:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-01 21:46:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 8. [2019-01-01 21:46:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:46:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-01 21:46:58,747 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:46:58,747 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:46:58,748 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:46:58,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-01 21:46:58,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:46:58,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:58,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:58,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:46:58,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:58,749 INFO L794 eck$LassoCheckResult]: Stem: 1808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1803#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1804#L560-2 [2019-01-01 21:46:58,749 INFO L796 eck$LassoCheckResult]: Loop: 1804#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1806#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1809#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1804#L560-2 [2019-01-01 21:46:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:46:58,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:58,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:58,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-01-01 21:46:58,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:58,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-01-01 21:46:58,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:59,316 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-01 21:46:59,723 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 21:47:01,356 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-01-01 21:47:01,840 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-01 21:47:01,845 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:01,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:01,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:01,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:01,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:01,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:01,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:01,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:01,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:47:01,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:01,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:01,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-01 21:47:01,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-01 21:47:01,877 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-01 21:47:01,879 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-01 21:47:01,881 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-01 21:47:01,886 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-01 21:47:01,889 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-01 21:47:01,891 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-01 21:47:01,893 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-01 21:47:01,905 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-01 21:47:01,911 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-01 21:47:01,913 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-01 21:47:01,916 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-01 21:47:01,919 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-01 21:47:01,921 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-01 21:47:01,923 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-01 21:47:01,926 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-01 21:47:03,406 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2019-01-01 21:47:03,765 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-01-01 21:47:03,766 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-01 21:47:03,769 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-01 21:47:03,772 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-01 21:47:04,067 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-01 21:47:04,346 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:47:04,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:47:04,681 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 21:47:29,920 WARN L181 SmtUtils]: Spent 25.06 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:47:29,977 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:29,978 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:29,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-01 21:47:29,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:29,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:29,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:29,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:29,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:29,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:29,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:29,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:29,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:29,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:29,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:29,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:29,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:29,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:29,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:29,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:29,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-01 21:47:29,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:29,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:29,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:29,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:29,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:29,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:29,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:29,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:29,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:29,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:29,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:29,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:29,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:29,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:29,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:29,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:29,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:29,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-01 21:47:29,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:29,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:29,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:29,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,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-01 21:47:30,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,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-01 21:47:30,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,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-01 21:47:30,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,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-01 21:47:30,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,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-01 21:47:30,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:30,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,209 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-01 21:47:30,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,305 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-01 21:47:30,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:30,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:30,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:30,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:30,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:30,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:30,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:30,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:30,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:30,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:30,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:30,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:30,678 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:30,678 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:30,679 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:47:30,679 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:30,679 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 Supporting invariants [] [2019-01-01 21:47:31,830 INFO L297 tatePredicateManager]: 106 out of 109 supporting invariants were superfluous and have been removed [2019-01-01 21:47:31,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:31,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:31,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:31,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:31,977 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 25 treesize of output 34 [2019-01-01 21:47:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,022 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-01 21:47:32,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:32,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:32,160 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-01 21:47:32,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2019-01-01 21:47:32,180 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-01 21:47:32,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:47:32,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:47:32,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 7 states. [2019-01-01 21:47:32,224 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-01 21:47:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:47:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-01 21:47:32,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:47:32,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:47:32,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:47:32,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:32,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-01 21:47:32,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:32,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2019-01-01 21:47:32,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:47:32,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:47:32,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-01-01 21:47:32,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:32,230 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:47:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-01-01 21:47:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-01 21:47:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:47:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 21:47:32,231 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:47:32,231 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:47:32,231 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:47:32,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 21:47:32,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:47:32,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:32,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:32,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-01 21:47:32,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:32,235 INFO L794 eck$LassoCheckResult]: Stem: 2314#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2309#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2310#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2311#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2317#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 2320#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2315#L558-1 [2019-01-01 21:47:32,235 INFO L796 eck$LassoCheckResult]: Loop: 2315#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2316#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 2318#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2315#L558-1 [2019-01-01 21:47:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:32,235 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2019-01-01 21:47:32,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2019-01-01 21:47:32,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:32,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:32,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 3 times [2019-01-01 21:47:32,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:32,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:32,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:47:32,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:47:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:47:32,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 21:47:32,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:47:32,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:32,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-01 21:47:32,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 21:47:32,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-01 21:47:32,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:47:32,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-01 21:47:32,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:32,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-01-01 21:47:32,923 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:32,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:32,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:32,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,059 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2019-01-01 21:47:33,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:33,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2019-01-01 21:47:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:47:33,103 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-01 21:47:33,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,191 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-01 21:47:33,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2019-01-01 21:47:33,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2019-01-01 21:47:33,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 21:47:33,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:33,234 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-01 21:47:33,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2019-01-01 21:47:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:33,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:47:33,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-01 21:47:33,467 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 21:47:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:47:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:47:33,477 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-01-01 21:47:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:33,688 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-01 21:47:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:47:33,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-01 21:47:33,690 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:33,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-01 21:47:33,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:33,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:33,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:33,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:33,691 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:33,691 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:33,691 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:33,691 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:47:33,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:33,691 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:33,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:33,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:33 BoogieIcfgContainer [2019-01-01 21:47:33,705 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:33,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:33,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:33,706 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:33,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:50" (3/4) ... [2019-01-01 21:47:33,713 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:33,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:33,715 INFO L168 Benchmark]: Toolchain (without parser) took 164836.52 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -355.9 MB). Peak memory consumption was 659.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:33,718 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:33,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:33,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.39 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-01 21:47:33,720 INFO L168 Benchmark]: Boogie Preprocessor took 46.86 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-01 21:47:33,727 INFO L168 Benchmark]: RCFGBuilder took 483.68 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:33,727 INFO L168 Benchmark]: BuchiAutomizer took 163555.62 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -209.4 MB). Peak memory consumption was 665.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:33,734 INFO L168 Benchmark]: Witness Printer took 9.10 ms. Allocated memory is still 2.0 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:33,740 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 665.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.39 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. * Boogie Preprocessor took 46.86 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 483.68 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 163555.62 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -209.4 MB). Peak memory consumption was 665.1 MB. Max. memory is 11.5 GB. * Witness Printer took 9.10 ms. Allocated memory is still 2.0 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 4 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 163.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 156.2s. Construction of modules took 0.3s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 31 SDslu, 8 SDs, 0 SdLazy, 122 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital28851 mio100 ax101 hnf100 lsp98 ukn20 mio100 lsp37 div100 bol100 ite100 ukn100 eq198 hnf87 smp95 dnf5673 smp88 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 947ms VariablesStem: 15 VariablesLoop: 12 DisjunctsStem: 128 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 260 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...