./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/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-0ed9222-m [2019-01-14 02:27:53,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:27:53,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:27:53,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:27:53,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:27:53,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:27:53,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:27:53,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:27:53,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:27:53,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:27:53,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:27:53,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:27:53,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:27:53,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:27:53,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:27:53,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:27:53,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:27:53,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:27:53,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:27:53,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:27:53,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:27:53,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:27:53,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:27:53,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:27:53,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:27:53,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:27:53,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:27:53,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:27:53,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:27:53,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:27:53,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:27:53,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:27:53,678 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:27:53,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:27:53,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:27:53,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:27:53,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:27:53,700 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:27:53,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:27:53,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:27:53,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:27:53,702 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:27:53,702 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:27:53,702 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:27:53,702 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:27:53,703 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:27:53,704 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:27:53,704 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:27:53,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:27:53,704 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:27:53,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:27:53,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:27:53,705 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:27:53,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:27:53,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:27:53,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:27:53,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:27:53,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:27:53,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:27:53,708 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:27:53,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:27:53,710 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-14 02:27:53,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:27:53,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:27:53,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:27:53,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:27:53,788 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:27:53,789 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-14 02:27:53,850 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7463a19c/78fefa5a34274680bacaa09d27ca2f62/FLAG2bde85484 [2019-01-14 02:27:54,339 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:27:54,340 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2019-01-14 02:27:54,359 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7463a19c/78fefa5a34274680bacaa09d27ca2f62/FLAG2bde85484 [2019-01-14 02:27:54,632 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7463a19c/78fefa5a34274680bacaa09d27ca2f62 [2019-01-14 02:27:54,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:27:54,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:27:54,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:27:54,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:27:54,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:27:54,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:27:54" (1/1) ... [2019-01-14 02:27:54,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e88383c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:54, skipping insertion in model container [2019-01-14 02:27:54,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:27:54" (1/1) ... [2019-01-14 02:27:54,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:27:54,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:27:55,031 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:27:55,046 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:27:55,200 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:27:55,248 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:27:55,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55 WrapperNode [2019-01-14 02:27:55,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:27:55,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:27:55,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:27:55,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:27:55,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:27:55,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:27:55,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:27:55,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:27:55,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... [2019-01-14 02:27:55,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:27:55,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:27:55,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:27:55,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:27:55,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:27:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:27:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:27:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:27:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:27:55,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:27:55,787 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:27:55,787 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:27:55,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:55 BoogieIcfgContainer [2019-01-14 02:27:55,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:27:55,789 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:27:55,789 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:27:55,793 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:27:55,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:55,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:27:54" (1/3) ... [2019-01-14 02:27:55,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@280e7357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:55, skipping insertion in model container [2019-01-14 02:27:55,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:55,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:55" (2/3) ... [2019-01-14 02:27:55,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@280e7357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:55, skipping insertion in model container [2019-01-14 02:27:55,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:55,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:55" (3/3) ... [2019-01-14 02:27:55,797 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2019-01-14 02:27:55,857 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:27:55,858 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:27:55,858 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:27:55,858 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:27:55,859 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:27:55,859 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:27:55,859 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:27:55,859 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:27:55,860 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:27:55,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:27:55,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:55,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:55,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:55,906 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:55,907 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:27:55,907 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:27:55,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:27:55,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:55,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:55,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:55,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:55,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:27:55,918 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-14 02:27:55,919 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-14 02:27:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:27:55,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:55,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:55,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:55,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2019-01-14 02:27:56,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-14 02:27:56,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:56,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:56,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:56,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:56,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:56,833 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 02:27:57,037 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 02:27:59,637 WARN L181 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-01-14 02:28:00,746 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 153 [2019-01-14 02:28:00,779 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:28:00,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:28:00,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:28:00,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:28:00,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:28:00,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:00,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:28:00,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:28:00,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:28:00,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:28:00,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:28:00,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,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-14 02:28:00,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-14 02:28:00,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-14 02:28:00,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:00,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:03,144 WARN L181 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 127 [2019-01-14 02:28:03,556 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-14 02:28:03,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:03,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:03,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:03,790 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:28:04,117 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-14 02:28:04,265 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:28:30,928 WARN L181 SmtUtils]: Spent 26.54 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:28:31,114 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:28:31,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:28:31,274 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:28:31,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,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-14 02:28:31,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:31,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:31,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:31,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:31,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:31,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:31,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:31,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:31,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:31,485 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-14 02:28:31,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:31,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:31,609 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-14 02:28:31,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:32,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,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-14 02:28:32,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:32,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:32,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:32,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:32,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:32,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:32,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:32,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:32,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:32,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:32,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:32,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:32,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:32,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:32,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:32,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:32,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:32,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:28:32,435 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:28:32,436 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:28:32,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:28:32,440 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:28:32,440 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:28:32,441 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-14 02:28:33,774 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-14 02:28:33,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:28:33,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:28:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:33,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:33,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:34,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:34,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:34,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:34,195 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-14 02:28:34,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:34,238 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-14 02:28:34,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:34,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:34,581 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-14 02:28:34,598 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-14 02:28:34,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:28:34,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:28:34,979 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-14 02:28:34,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-14 02:28:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:28:35,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:28:35,124 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-14 02:28:35,291 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-14 02:28:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:28:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:28:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-14 02:28:35,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:28:35,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:35,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:28:35,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:35,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:28:35,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:35,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-14 02:28:35,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:35,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 14 transitions. [2019-01-14 02:28:35,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:28:35,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:28:35,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:28:35,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:28:35,324 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:28:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:28:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:28:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:28:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:28:35,355 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:28:35,355 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:28:35,355 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:28:35,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-14 02:28:35,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:35,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:28:35,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:28:35,357 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:28:35,357 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:28:35,358 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~mem17;havoc main_#t~mem18; 548#L560-2 [2019-01-14 02:28:35,358 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-14 02:28:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-01-14 02:28:35,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2019-01-14 02:28:35,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:35,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-01-14 02:28:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:35,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:28:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:36,062 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 02:28:36,472 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 02:28:39,182 WARN L181 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 211 DAG size of output: 181 [2019-01-14 02:28:40,525 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 166 [2019-01-14 02:28:40,530 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:28:40,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:28:40,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:28:40,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:28:40,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:28:40,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:40,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:28:40,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:28:40,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:28:40,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:28:40,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:28:40,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:40,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:42,813 WARN L181 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 137 [2019-01-14 02:28:43,183 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-14 02:28:43,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:43,471 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:28:43,756 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-14 02:28:43,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:29:09,015 WARN L181 SmtUtils]: Spent 25.00 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:29:09,173 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:29:09,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:29:09,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:29:09,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:09,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:09,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:09,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,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-14 02:29:09,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,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-14 02:29:09,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:09,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:09,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:09,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:09,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:09,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:09,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:09,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:09,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:09,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:09,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:09,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:09,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:09,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:09,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:09,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:09,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:09,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:09,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:09,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:09,423 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:29:09,458 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:29:09,458 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:29:09,459 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:29:09,461 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:29:09,462 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:29:09,462 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_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-14 02:29:10,475 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-14 02:29:10,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:10,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:10,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:10,567 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-14 02:29:10,573 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-14 02:29:10,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,605 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-14 02:29:10,666 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-14 02:29:10,806 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 02:29:10,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,846 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-14 02:29:10,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:10,946 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-14 02:29:10,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:10,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,129 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-14 02:29:11,130 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-14 02:29:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:11,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:11,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:11,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:11,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:11,331 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-14 02:29:11,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:11,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:29:11,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:11,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:11,479 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-14 02:29:11,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:29:11,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:29:11,567 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-14 02:29:11,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-14 02:29:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:11,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:29:11,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:29:11,757 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-14 02:29:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:29:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:29:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-14 02:29:11,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:29:11,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:11,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:29:11,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:11,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:29:11,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:11,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-14 02:29:11,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:29:11,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 02:29:11,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:29:11,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:29:11,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-14 02:29:11,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:29:11,771 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:29:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-14 02:29:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 02:29:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:29:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 02:29:11,774 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:29:11,774 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:29:11,774 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:29:11,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-14 02:29:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:29:11,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:29:11,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:29:11,777 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2019-01-14 02:29:11,777 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:29:11,778 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~mem17;havoc main_#t~mem18; 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~mem17;havoc main_#t~mem18; 1097#L560-2 [2019-01-14 02:29:11,778 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-14 02:29:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 179493187, now seen corresponding path program 2 times [2019-01-14 02:29:11,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:29:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:29:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:29:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 3 times [2019-01-14 02:29:11,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:29:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:29:11,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:29:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 47257513, now seen corresponding path program 2 times [2019-01-14 02:29:11,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:29:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:29:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:29:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:29:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:29:12,300 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 02:29:21,495 WARN L181 SmtUtils]: Spent 9.14 s on a formula simplification. DAG size of input: 242 DAG size of output: 210 [2019-01-14 02:29:24,695 WARN L181 SmtUtils]: Spent 3.20 s on a formula simplification that was a NOOP. DAG size: 181 [2019-01-14 02:29:24,700 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:29:24,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:29:24,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:29:24,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:29:24,701 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:29:24,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:29:24,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:29:24,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:29:24,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:29:24,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:29:24,701 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:29:24,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,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-14 02:29:24,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:24,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:28,541 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-14 02:29:28,922 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-01-14 02:29:28,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:28,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-14 02:29:28,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-14 02:29:28,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:29:29,188 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:29:29,582 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-14 02:29:29,678 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:29:54,657 WARN L181 SmtUtils]: Spent 24.84 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:29:54,892 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:29:54,986 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:29:54,986 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:29:54,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:54,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:54,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:54,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:54,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:54,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:54,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:54,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:54,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:54,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:54,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:54,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:54,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:54,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,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-14 02:29:55,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,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-14 02:29:55,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,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-14 02:29:55,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,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-14 02:29:55,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:55,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:55,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:55,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,130 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-14 02:29:55,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,184 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-14 02:29:55,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:55,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:55,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-14 02:29:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:55,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:55,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:55,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:55,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:55,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:55,692 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:29:55,708 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:29:55,708 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:29:55,708 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:29:55,711 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:29:55,711 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:29:55,712 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-14 02:29:57,049 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-01-14 02:29:57,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:57,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:57,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:57,132 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-14 02:29:57,136 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-14 02:29:57,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,161 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-14 02:29:57,171 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-14 02:29:57,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,211 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-14 02:29:57,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,354 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-14 02:29:57,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,388 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,537 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-14 02:29:57,539 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-14 02:29:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:57,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:57,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,643 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-14 02:29:57,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,657 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-14 02:29:57,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:57,721 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-14 02:29:57,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:29:57,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:29:57,814 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-14 02:29:57,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-14 02:29:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:57,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:29:57,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:29:58,099 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 02:29:58,156 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-14 02:29:58,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:29:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:29:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-14 02:29:58,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:29:58,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:58,160 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:29:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:58,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:58,242 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-14 02:29:58,247 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-14 02:29:58,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,271 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-14 02:29:58,305 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-14 02:29:58,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,345 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-14 02:29:58,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,511 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-14 02:29:58,512 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-14 02:29:58,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,689 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-14 02:29:58,690 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-14 02:29:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:58,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:58,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,870 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-14 02:29:58,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,877 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-14 02:29:58,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:58,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:58,939 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-14 02:29:58,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:29:58,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:29:59,033 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-14 02:29:59,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-14 02:29:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:59,134 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:29:59,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:29:59,228 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-14 02:29:59,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:29:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:29:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-14 02:29:59,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:29:59,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:59,230 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:29:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:59,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:59,290 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-14 02:29:59,294 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-14 02:29:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,322 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-14 02:29:59,332 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-14 02:29:59,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,401 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-14 02:29:59,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,523 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-14 02:29:59,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,592 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,775 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-14 02:29:59,776 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-01-14 02:29:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:59,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:59,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,889 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-14 02:29:59,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,896 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-14 02:29:59,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:59,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:59,964 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-14 02:29:59,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:30:00,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:00,075 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-14 02:30:00,075 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2019-01-14 02:30:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:00,178 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:30:00,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:30:00,285 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-14 02:30:00,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:30:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:30:00,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:30:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 02:30:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:30:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:00,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2019-01-14 02:30:00,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:30:00,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 26 transitions. [2019-01-14 02:30:00,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:30:00,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:30:00,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-14 02:30:00,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:00,300 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:30:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-14 02:30:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 8. [2019-01-14 02:30:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:30:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 02:30:00,304 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:30:00,304 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:30:00,304 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:30:00,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 02:30:00,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:30:00,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:00,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:00,308 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:00,309 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:00,309 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-14 02:30:00,309 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~mem17;havoc main_#t~mem18; 1804#L560-2 [2019-01-14 02:30:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:30:00,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:00,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-01-14 02:30:00,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:00,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-01-14 02:30:00,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:00,619 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 02:30:02,116 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-01-14 02:30:02,590 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-14 02:30:02,595 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:02,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:02,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:02,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:02,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:02,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:02,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:02,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:02,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:30:02,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:02,596 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:02,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:02,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:04,186 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2019-01-14 02:30:04,550 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-01-14 02:30:04,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:04,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:04,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:04,951 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-14 02:30:05,233 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:30:05,280 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:30:05,470 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:30:30,545 WARN L181 SmtUtils]: Spent 24.90 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:30:30,599 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:30,600 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:30,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,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-14 02:30:30,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:30,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:30,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:30,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:30,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:30,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:30,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:30,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:30,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:30,810 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-14 02:30:30,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:30,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:30,893 INFO L402 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-01-14 02:30:30,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:31,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:31,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:31,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:31,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:31,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:31,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:31,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:31,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:31,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:31,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:31,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:30:31,250 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:30:31,250 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:31,250 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:30:31,251 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:31,251 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-14 02:30:32,255 INFO L297 tatePredicateManager]: 106 out of 109 supporting invariants were superfluous and have been removed [2019-01-14 02:30:32,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:32,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:32,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:32,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:32,368 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-14 02:30:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:32,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:30:32,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:32,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:32,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:32,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2019-01-14 02:30:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:32,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:30:32,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:30:32,455 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-14 02:30:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:30:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-14 02:30:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:30:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:30:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:30:32,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:32,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-14 02:30:32,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:30:32,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2019-01-14 02:30:32,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:30:32,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:30:32,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-01-14 02:30:32,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:32,463 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:30:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-01-14 02:30:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 02:30:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:30:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:30:32,468 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:30:32,468 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:30:32,469 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:30:32,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:30:32,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:30:32,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:32,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:32,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-14 02:30:32,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:32,475 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-14 02:30:32,475 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~mem17;havoc main_#t~mem18; 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-14 02:30:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2019-01-14 02:30:32,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2019-01-14 02:30:32,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:32,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 3 times [2019-01-14 02:30:32,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:33,126 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-14 02:30:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:30:33,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:30:33,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:30:33,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 02:30:33,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:30:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:33,240 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-14 02:30:33,280 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-14 02:30:33,356 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-14 02:30:33,374 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-14 02:30:33,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,428 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-14 02:30:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,530 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-14 02:30:33,531 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,666 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-14 02:30:33,667 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2019-01-14 02:30:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,710 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-14 02:30:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:33,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:30:33,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2019-01-14 02:30:33,830 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-14 02:30:33,835 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-14 02:30:33,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:33,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2019-01-14 02:30:33,846 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-14 02:30:33,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:30:33,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-14 02:30:34,047 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 02:30:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:30:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:30:34,053 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-01-14 02:30:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:34,222 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-14 02:30:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:30:34,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-14 02:30:34,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:34,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-14 02:30:34,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:34,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:34,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:34,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:34,225 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:34,225 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:34,225 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:34,225 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:30:34,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:34,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:34,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:34,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:34 BoogieIcfgContainer [2019-01-14 02:30:34,235 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:34,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:34,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:34,236 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:34,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:55" (3/4) ... [2019-01-14 02:30:34,240 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:34,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:34,241 INFO L168 Benchmark]: Toolchain (without parser) took 159604.53 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 952.7 MB in the beginning and 1.7 GB in the end (delta: -754.9 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:34,243 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:34,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:34,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:34,246 INFO L168 Benchmark]: Boogie Preprocessor took 26.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:34,246 INFO L168 Benchmark]: RCFGBuilder took 467.98 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:34,249 INFO L168 Benchmark]: BuchiAutomizer took 158446.26 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 943.7 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -620.5 MB). Peak memory consumption was 323.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:34,250 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 2.1 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:34,255 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.15 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 610.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.58 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 26.51 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 467.98 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 158446.26 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 943.7 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -620.5 MB). Peak memory consumption was 323.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 2.1 GB. Free memory is still 1.7 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 158.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 151.8s. Construction of modules took 0.2s. Büchi inclusion checks took 6.1s. 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.2s 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: 887ms 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...