./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_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-recursive-malloc/rec_malloc_ex11D_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 570a3560ecb7b29b974852ea58d8cc903e7c487d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:48:19,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:19,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:19,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:19,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:19,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:19,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:19,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:19,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:19,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:19,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:19,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:19,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:19,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:19,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:19,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:19,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:19,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:19,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:19,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:19,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:19,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:19,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:19,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:19,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:19,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:19,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:19,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:19,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:19,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:19,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:19,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:19,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:19,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:19,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:19,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:19,690 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:48:19,706 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:19,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:19,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:19,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:19,708 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:19,708 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:19,708 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:19,708 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:19,709 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:19,709 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:19,709 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:19,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:19,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:19,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:19,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:19,711 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:19,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:19,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:19,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:19,712 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:19,712 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:19,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:19,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:19,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:19,712 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:19,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:19,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:19,716 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:19,717 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:19,717 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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2019-01-14 02:48:19,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:19,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:19,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:19,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:19,787 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:19,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2019-01-14 02:48:19,846 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2c7ec25/62f648db9b504a6aab9a3a844ba22698/FLAG2cd99baa0 [2019-01-14 02:48:20,226 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:20,226 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2019-01-14 02:48:20,232 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2c7ec25/62f648db9b504a6aab9a3a844ba22698/FLAG2cd99baa0 [2019-01-14 02:48:20,674 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2c7ec25/62f648db9b504a6aab9a3a844ba22698 [2019-01-14 02:48:20,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:20,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:20,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:20,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:20,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:20,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:20,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658d12bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20, skipping insertion in model container [2019-01-14 02:48:20,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:20,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:20,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:20,899 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:20,912 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:20,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:20,951 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:20,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20 WrapperNode [2019-01-14 02:48:20,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:20,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:20,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:20,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:20,962 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:48:20" (1/1) ... [2019-01-14 02:48:20,971 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:48:20" (1/1) ... [2019-01-14 02:48:20,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:20,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:20,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:20,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:21,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (1/1) ... [2019-01-14 02:48:21,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:21,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:21,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:21,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:21,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (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:48:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-14 02:48:21,196 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-14 02:48:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:21,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:21,576 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:21,576 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:48:21,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:21 BoogieIcfgContainer [2019-01-14 02:48:21,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:21,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:21,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:21,582 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:21,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:21,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:20" (1/3) ... [2019-01-14 02:48:21,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff01184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:21, skipping insertion in model container [2019-01-14 02:48:21,584 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:21,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:20" (2/3) ... [2019-01-14 02:48:21,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff01184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:21, skipping insertion in model container [2019-01-14 02:48:21,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:21,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:21" (3/3) ... [2019-01-14 02:48:21,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D_true-termination.c.i [2019-01-14 02:48:21,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:21,647 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:21,648 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:21,648 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:21,648 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:21,648 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:21,648 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:21,648 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:21,649 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:21,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:48:21,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:21,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:21,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:21,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:21,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:21,704 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:21,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:48:21,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:21,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:21,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:21,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:21,707 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:21,717 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L30-3true [2019-01-14 02:48:21,717 INFO L796 eck$LassoCheckResult]: Loop: 7#L30-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L30-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 7#L30-3true [2019-01-14 02:48:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-01-14 02:48:21,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:21,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-01-14 02:48:21,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:22,181 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:48:22,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:22,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:48:22,188 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:48:22,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:48:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:48:22,206 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-01-14 02:48:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:22,491 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-14 02:48:22,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:48:22,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-01-14 02:48:22,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:22,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-01-14 02:48:22,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:48:22,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:48:22,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-14 02:48:22,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:22,518 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-14 02:48:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:48:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:48:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 02:48:22,548 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:22,548 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:22,549 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:22,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-14 02:48:22,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:48:22,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:22,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:22,552 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:48:22,552 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:22,553 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L30-3 [2019-01-14 02:48:22,553 INFO L796 eck$LassoCheckResult]: Loop: 57#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 63#recFINAL assume true; 65#recEXIT >#42#return; 60#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 61#recFINAL assume true; 66#recEXIT >#44#return; 55#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 57#L30-3 [2019-01-14 02:48:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-01-14 02:48:22,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-01-14 02:48:22,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-01-14 02:48:22,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:22,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:22,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,000 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:48:23,169 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:48:23,890 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-01-14 02:48:24,199 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 02:48:24,323 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:48:25,042 WARN L181 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2019-01-14 02:48:25,177 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:48:25,290 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-14 02:48:25,345 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:25,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:25,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:25,347 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:25,347 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:25,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:25,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:25,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:25,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:48:25,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:25,348 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:25,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,607 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-14 02:48:25,862 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-14 02:48:25,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:25,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,445 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-01-14 02:48:26,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:26,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:26,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:26,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:26,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:26,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:26,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:26,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:26,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:26,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:26,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:26,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:26,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:26,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:48:26,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:26,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:26,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:26,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:26,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:26,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:26,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:26,669 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:26,669 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:48:26,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:26,675 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:26,675 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:26,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-01-14 02:48:26,691 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:26,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:26,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:26,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:27,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:27,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:27,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 02:48:27,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-14 02:48:27,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:48:27,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-01-14 02:48:27,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 16 [2019-01-14 02:48:27,127 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 16 treesize of output 10 [2019-01-14 02:48:27,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:27,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-01-14 02:48:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:48:27,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:48:27,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-14 02:48:27,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-01-14 02:48:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:48:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-01-14 02:48:27,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-14 02:48:27,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-01-14 02:48:27,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-01-14 02:48:27,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:27,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-01-14 02:48:27,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:27,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-01-14 02:48:27,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-14 02:48:27,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 02:48:27,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-14 02:48:27,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:27,535 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 02:48:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-14 02:48:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-14 02:48:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 02:48:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-01-14 02:48:27,545 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-14 02:48:27,545 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-14 02:48:27,545 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:48:27,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-01-14 02:48:27,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:27,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:27,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:27,550 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:27,550 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:48:27,550 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 274#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 288#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-14 02:48:27,550 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-14 02:48:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-01-14 02:48:27,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:27,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-01-14 02:48:27,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-01-14 02:48:27,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:27,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:27,879 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-01-14 02:48:28,241 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-14 02:48:28,700 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-01-14 02:48:28,828 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:48:29,006 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 02:48:29,391 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-01-14 02:48:29,516 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 02:48:29,519 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:29,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:29,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:29,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:29,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:29,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:29,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:29,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:29,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:48:29,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:29,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:29,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,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:48:29,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,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:48:29,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,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:48:29,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:48:29,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:48:29,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,763 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-01-14 02:48:29,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:29,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:48:30,505 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-14 02:48:30,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:30,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:30,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:48:30,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48: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:48:30,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:30,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:30,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:30,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:30,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48: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:48:30,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:30,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:30,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:30,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:30,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:30,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:30,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:30,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:30,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:30,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:30,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:30,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:30,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:30,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:30,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:30,849 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:48:30,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:30,852 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:30,853 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:30,853 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-01-14 02:48:30,883 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:48:30,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:31,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:31,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2019-01-14 02:48:31,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:48:31,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:31,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:31,466 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 2 case distinctions, treesize of input 30 treesize of output 40 [2019-01-14 02:48:31,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:31,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:31,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:31,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-14 02:48:31,758 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:48:31,758 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:48:31,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 02:48:31,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-01-14 02:48:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:48:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-14 02:48:31,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:48:31,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:31,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:48:31,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:31,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:48:31,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:31,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-01-14 02:48:31,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:31,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-01-14 02:48:31,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-14 02:48:31,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-14 02:48:31,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-01-14 02:48:31,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:31,981 INFO L706 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-01-14 02:48:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-01-14 02:48:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-01-14 02:48:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 02:48:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-01-14 02:48:31,993 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-14 02:48:31,993 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-14 02:48:31,993 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:48:31,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-01-14 02:48:31,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:31,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:31,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:31,998 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:31,998 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:31,998 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 500#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 477#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 479#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 544#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 542#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 541#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 488#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 540#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 548#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 547#recFINAL assume true; 530#recEXIT >#42#return; 527#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 525#recFINAL assume true; 518#recEXIT >#44#return; 473#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 474#L38-3 [2019-01-14 02:48:31,998 INFO L796 eck$LassoCheckResult]: Loop: 474#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 509#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 526#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 524#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 505#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 506#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 504#recFINAL assume true; 507#recEXIT >#42#return; 516#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 522#recFINAL assume true; 515#recEXIT >#44#return; 513#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 474#L38-3 [2019-01-14 02:48:31,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-01-14 02:48:31,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:31,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:32,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,248 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-14 02:48:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:32,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:32,460 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:48:32,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 02:48:32,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:48:32,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:32,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:32,738 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 2 case distinctions, treesize of input 21 treesize of output 33 [2019-01-14 02:48:32,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:32,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:32,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:32,781 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2019-01-14 02:48:32,873 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:48:32,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:32,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-01-14 02:48:32,920 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 02:48:32,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:32,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:32,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:32,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2019-01-14 02:48:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:33,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:33,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-01-14 02:48:33,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-01-14 02:48:33,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:33,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:33,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:33,518 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:48:33,756 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 02:48:34,104 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:48:34,448 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-01-14 02:48:35,090 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2019-01-14 02:48:35,217 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 02:48:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:48:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:48:35,219 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-01-14 02:48:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:35,366 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-01-14 02:48:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:48:35,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-01-14 02:48:35,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:35,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-01-14 02:48:35,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:48:35,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:48:35,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-01-14 02:48:35,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:35,375 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-01-14 02:48:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-01-14 02:48:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-14 02:48:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 02:48:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-14 02:48:35,382 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 02:48:35,382 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 02:48:35,383 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:48:35,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-01-14 02:48:35,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:35,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:35,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:35,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:35,387 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:48:35,387 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 711#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 712#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 731#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 732#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 743#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 721#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 738#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 725#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 726#recFINAL assume true; 729#recEXIT >#42#return; 730#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 735#recFINAL assume true; 734#recEXIT >#44#return; 702#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 703#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 713#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 715#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 718#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 705#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 704#recENTRY [2019-01-14 02:48:35,387 INFO L796 eck$LassoCheckResult]: Loop: 704#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 704#recENTRY [2019-01-14 02:48:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-01-14 02:48:35,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:35,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-01-14 02:48:35,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:35,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:35,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-01-14 02:48:35,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:35,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:35,717 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-14 02:48:36,316 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-01-14 02:48:37,926 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 229 DAG size of output: 191 [2019-01-14 02:48:38,286 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-14 02:48:38,660 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-01-14 02:48:39,013 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:48:39,025 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:39,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:39,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:39,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:39,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:39,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:39,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:39,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:39,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:48:39,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:39,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:39,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,347 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-01-14 02:48:39,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:39,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:40,385 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:48:40,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:40,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:40,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,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:48:40,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,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:48:40,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:40,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:40,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:40,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:40,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:40,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:40,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:40,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:40,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:40,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:40,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:40,654 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:40,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:40,666 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:48:40,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:40,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:40,671 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:40,671 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 + 1 Supporting invariants [] [2019-01-14 02:48:40,726 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:48:40,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:40,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:41,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:41,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2019-01-14 02:48:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-01-14 02:48:41,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:41,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:41,206 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 30 treesize of output 32 [2019-01-14 02:48:41,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:41,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:41,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:41,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2019-01-14 02:48:41,381 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:48:41,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-14 02:48:41,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-01-14 02:48:41,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2019-01-14 02:48:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-14 02:48:41,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:41,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:41,518 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:41,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:41,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:41,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:41,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2019-01-14 02:48:41,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-14 02:48:41,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:41,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-14 02:48:41,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:41,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:41,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:41,858 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2019-01-14 02:48:41,893 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:48:41,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-14 02:48:41,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-01-14 02:48:42,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2019-01-14 02:48:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-14 02:48:42,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:42,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:42,006 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:42,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:42,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:42,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:42,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2019-01-14 02:48:42,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-01-14 02:48:42,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:42,315 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 30 treesize of output 32 [2019-01-14 02:48:42,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:42,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:42,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:42,357 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2019-01-14 02:48:42,390 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:48:42,391 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-14 02:48:42,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-01-14 02:48:42,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 68 states and 78 transitions. Complement of second has 16 states. [2019-01-14 02:48:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-01-14 02:48:42,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-14 02:48:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:42,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-14 02:48:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:42,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-14 02:48:42,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:42,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-01-14 02:48:42,604 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:42,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-01-14 02:48:42,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:42,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:42,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:42,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:42,605 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:42,605 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:42,605 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:42,605 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:48:42,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:42,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:42,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:42,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:42 BoogieIcfgContainer [2019-01-14 02:48:42,619 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:42,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:42,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:42,620 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:42,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:21" (3/4) ... [2019-01-14 02:48:42,630 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:42,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:42,631 INFO L168 Benchmark]: Toolchain (without parser) took 21953.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 219.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:42,634 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:42,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.30 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:42,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.83 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:42,637 INFO L168 Benchmark]: Boogie Preprocessor took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:42,641 INFO L168 Benchmark]: RCFGBuilder took 535.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:42,641 INFO L168 Benchmark]: BuchiAutomizer took 21041.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:42,642 INFO L168 Benchmark]: Witness Printer took 10.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:42,650 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.30 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.83 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 535.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21041.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. * Witness Printer took 10.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.5s. Construction of modules took 0.6s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 84 SDtfs, 61 SDslu, 152 SDs, 0 SdLazy, 260 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf100 lsp98 ukn38 mio100 lsp28 div100 bol100 ite100 ukn100 eq185 hnf89 smp98 dnf436 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...