./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c --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-restricted-15/NO_23_false-termination_true-no-overflow.c -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 cee692bfa384f30ecd519bc2dc9dfe35c80a4941 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:22:49,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:22:49,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:22:49,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:22:49,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:22:49,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:22:49,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:22:49,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:22:49,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:22:49,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:22:49,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:22:49,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:22:49,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:22:49,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:22:49,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:22:49,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:22:49,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:22:49,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:22:49,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:22:49,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:22:49,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:22:49,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:22:49,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:22:49,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:22:49,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:22:49,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:22:49,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:22:49,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:22:49,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:22:49,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:22:49,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:22:49,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:22:49,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:22:49,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:22:49,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:22:49,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:22:49,635 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:22:49,658 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:22:49,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:22:49,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:22:49,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:22:49,660 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:22:49,661 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:22:49,661 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:22:49,661 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:22:49,661 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:22:49,661 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:22:49,661 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:22:49,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:22:49,662 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:22:49,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:22:49,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:22:49,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:22:49,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:22:49,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:22:49,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:22:49,665 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:22:49,665 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:22:49,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:22:49,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:22:49,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:22:49,666 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:22:49,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:22:49,667 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:22:49,667 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:22:49,668 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:22:49,669 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 -> cee692bfa384f30ecd519bc2dc9dfe35c80a4941 [2019-01-14 02:22:49,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:22:49,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:22:49,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:22:49,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:22:49,751 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:22:49,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2019-01-14 02:22:49,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f19e6cf2/88a7cc91012547fdbee570d2cf34fc87/FLAG59b4d71aa [2019-01-14 02:22:50,274 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:22:50,275 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2019-01-14 02:22:50,281 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f19e6cf2/88a7cc91012547fdbee570d2cf34fc87/FLAG59b4d71aa [2019-01-14 02:22:50,656 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f19e6cf2/88a7cc91012547fdbee570d2cf34fc87 [2019-01-14 02:22:50,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:22:50,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:22:50,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:50,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:22:50,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:22:50,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb39394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50, skipping insertion in model container [2019-01-14 02:22:50,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:22:50,697 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:22:50,894 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:50,900 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:22:50,915 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:50,930 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:22:50,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50 WrapperNode [2019-01-14 02:22:50,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:50,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:50,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:22:50,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:22:50,941 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:22:50" (1/1) ... [2019-01-14 02:22:50,947 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:22:50" (1/1) ... [2019-01-14 02:22:50,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:50,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:22:50,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:22:50,972 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:22:50,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (1/1) ... [2019-01-14 02:22:50,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:22:50,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:22:50,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:22:50,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:22:50,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (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:22:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:22:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:22:51,251 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:22:51,251 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:22:51,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:51 BoogieIcfgContainer [2019-01-14 02:22:51,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:22:51,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:22:51,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:22:51,256 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:22:51,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:51,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:22:50" (1/3) ... [2019-01-14 02:22:51,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14dd5903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:51, skipping insertion in model container [2019-01-14 02:22:51,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:51,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:50" (2/3) ... [2019-01-14 02:22:51,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14dd5903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:51, skipping insertion in model container [2019-01-14 02:22:51,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:51,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:51" (3/3) ... [2019-01-14 02:22:51,261 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_23_false-termination_true-no-overflow.c [2019-01-14 02:22:51,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:22:51,312 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:22:51,312 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:22:51,312 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:22:51,312 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:22:51,313 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:22:51,313 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:22:51,313 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:22:51,313 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:22:51,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:22:51,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:51,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:51,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:51,355 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:51,355 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:22:51,355 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:22:51,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:22:51,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:51,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:51,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:51,357 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:51,357 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:22:51,365 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7#L10-2true [2019-01-14 02:22:51,366 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 100); 3#L10true assume main_~i~0 < 50;main_~i~0 := 51; 7#L10-2true [2019-01-14 02:22:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:22:51,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:51,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:22:51,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:51,474 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:22:51,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:51,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:51,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:51,628 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-14 02:22:51,689 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:51,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:51,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:51,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:51,691 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:51,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:51,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:51,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:51,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:22:51,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:51,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:51,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:51,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:51,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:51,907 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:51,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:51,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:51,940 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:51,941 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:51,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:51,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:51,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:51,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:51,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:51,974 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:52,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:52,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:52,058 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:52,060 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:52,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:52,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:52,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:52,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:52,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:52,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:52,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:52,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:22:52,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:52,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:52,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:22:52,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:52,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:52,416 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:52,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:52,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:52,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:52,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:52,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:52,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:52,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:52,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:52,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:52,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:52,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:52,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:52,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:52,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:52,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:52,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:52,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:52,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:52,453 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:52,455 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:52,456 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:52,456 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:52,456 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-01-14 02:22:52,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:52,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:52,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:52,570 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:22:52,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:52,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:22:52,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-14 02:22:52,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:22:52,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:22:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:52,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:22:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:52,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:22:52,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:52,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:22:52,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:52,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:22:52,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:22:52,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:22:52,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:22:52,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:52,654 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:22:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:22:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:22:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:22:52,678 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:52,679 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:22:52,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:22:52,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:22:52,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:52,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:52,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:52,680 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:52,680 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:22:52,681 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 68#L10-2 assume !!(main_~i~0 < 100); 63#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 64#L10-2 [2019-01-14 02:22:52,681 INFO L796 eck$LassoCheckResult]: Loop: 64#L10-2 assume !!(main_~i~0 < 100); 69#L10 assume main_~i~0 < 50;main_~i~0 := 51; 64#L10-2 [2019-01-14 02:22:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:22:52,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:52,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:52,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:52,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:52,727 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:22:52,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:52,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:22:52,732 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:22:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:22:52,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:52,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:52,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:52,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:52,822 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:52,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:52,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:52,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:52,822 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:52,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:52,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:52,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:52,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:22:52,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:52,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:52,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:52,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:52,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:52,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:52,986 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:52,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:52,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:53,013 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:53,013 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:53,018 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:53,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:53,097 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:53,099 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:53,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:53,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:53,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:53,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:53,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:53,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:53,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:22:53,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:53,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:53,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:53,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:22:53,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:22:53,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:53,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:53,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:53,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:53,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:53,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:53,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:53,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:53,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:53,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:53,190 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:53,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:53,194 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:53,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:53,195 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:53,195 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:53,195 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-01-14 02:22:53,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:53,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:53,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:53,273 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:22:53,273 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:53,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:22:53,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:22:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:22:53,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:22:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:53,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:22:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:53,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:22:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:53,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:22:53,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:53,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:22:53,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:22:53,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:22:53,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:22:53,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:53,361 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:22:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:22:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:22:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:22:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:22:53,366 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:22:53,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:22:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:22:53,370 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2019-01-14 02:22:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:53,402 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-01-14 02:22:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:22:53,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-14 02:22:53,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:53,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-14 02:22:53,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:22:53,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:22:53,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:22:53,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:53,408 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:22:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:22:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 02:22:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:22:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-14 02:22:53,410 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 02:22:53,410 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 02:22:53,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:22:53,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-14 02:22:53,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:22:53,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:53,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:53,412 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2019-01-14 02:22:53,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:22:53,412 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 144#L10-2 assume !!(main_~i~0 < 100); 145#L10 assume main_~i~0 < 50;main_~i~0 := 51; 149#L10-2 assume !!(main_~i~0 < 100); 139#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 140#L10-2 assume !!(main_~i~0 < 100); 146#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 148#L10-2 [2019-01-14 02:22:53,412 INFO L796 eck$LassoCheckResult]: Loop: 148#L10-2 assume !!(main_~i~0 < 100); 147#L10 assume main_~i~0 < 50;main_~i~0 := 51; 148#L10-2 [2019-01-14 02:22:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2019-01-14 02:22:53,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:53,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:22:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:22:53,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:22:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-14 02:22:53,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:53,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:53,609 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-14 02:22:53,692 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:53,692 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:53,692 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:53,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:53,693 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:53,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:53,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:53,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:22:53,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:53,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:53,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:53,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:53,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:53,905 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:53,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:53,933 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:53,934 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:53,940 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:53,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:53,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:54,028 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:54,031 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:54,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:54,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:54,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:54,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:54,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:54,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:54,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:54,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:22:54,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:54,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:54,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:54,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:54,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:54,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:54,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:54,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:54,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:54,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:54,176 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:54,176 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:54,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:54,177 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:54,177 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:54,177 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2019-01-14 02:22:54,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,253 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:22:54,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:54,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:22:54,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2019-01-14 02:22:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:22:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:22:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:54,273 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:22:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,309 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:22:54,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:54,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:22:54,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2019-01-14 02:22:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:22:54,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:22:54,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:54,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:22:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:54,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:54,363 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:22:54,363 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:54,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:22:54,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2019-01-14 02:22:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:22:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:22:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:22:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:22:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:54,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-01-14 02:22:54,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:22:54,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2019-01-14 02:22:54,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:22:54,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:22:54,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-14 02:22:54,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:54,398 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:22:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-14 02:22:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2019-01-14 02:22:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:22:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:22:54,400 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:22:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:22:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:22:54,400 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2019-01-14 02:22:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:54,419 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-14 02:22:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:22:54,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-14 02:22:54,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:22:54,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2019-01-14 02:22:54,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:22:54,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:22:54,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 02:22:54,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:54,422 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:22:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 02:22:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2019-01-14 02:22:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:22:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-14 02:22:54,424 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:22:54,424 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:22:54,424 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:22:54,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-01-14 02:22:54,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:22:54,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:54,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:54,426 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:54,426 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:22:54,426 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 [2019-01-14 02:22:54,426 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2019-01-14 02:22:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:22:54,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:54,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 1 times [2019-01-14 02:22:54,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 2 times [2019-01-14 02:22:54,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:54,542 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:54,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:54,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:54,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:54,542 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:54,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:54,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:54,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:54,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:22:54,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:54,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:54,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:22:54,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,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:22:54,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:54,710 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:54,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:54,714 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:54,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:54,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:54,769 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:54,771 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:54,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:54,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:54,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:54,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:54,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:54,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:54,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:54,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:22:54,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:54,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:54,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:54,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:54,911 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:54,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:54,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:54,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:54,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:54,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:54,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:54,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:54,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:54,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:54,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:54,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,949 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:22:54,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,950 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:54,953 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:54,954 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:54,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,971 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:54,973 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:54,973 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:54,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:54,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,982 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:54,982 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:22:54,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:54,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:54,987 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:54,987 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:54,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:54,991 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:22:54,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:54,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:54,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:54,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:54,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:54,995 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:54,995 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,033 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,038 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,038 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:22:55,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,073 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,074 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,084 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:22:55,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,086 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,095 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,095 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,127 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,127 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:22:55,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:55,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,151 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,157 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,157 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,163 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:22:55,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:55,174 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:55,177 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:55,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,207 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:55,209 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:55,212 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:55,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,226 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,227 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:55,227 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:22:55,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,232 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,232 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:22:55,237 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:22:55,237 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:22:55,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,246 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:22:55,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,250 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:22:55,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,252 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,252 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,309 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:22:55,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,317 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,318 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,331 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:22:55,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:22:55,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,337 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:22:55,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,340 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,342 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,342 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,350 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:22:55,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,352 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,363 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,363 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,397 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,402 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,403 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,416 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,417 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,422 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:22:55,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:22:55,435 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 02:22:55,435 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-14 02:22:55,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,448 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:22:55,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,452 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,456 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,456 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,487 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,488 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,497 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,502 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:22:55,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,507 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:22:55,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,507 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:22:55,514 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:22:55,514 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:22:55,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,521 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:22:55,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,522 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,523 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:22:55,532 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 02:22:55,533 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:22:55,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,604 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:22:55,608 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 02:22:55,608 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:22:55,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,622 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:22:55,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:55,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:55,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:55,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:22:55,628 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:22:55,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:55,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:55,632 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:22:55,635 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 02:22:55,635 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:22:55,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:55,643 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2019-01-14 02:22:55,643 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2019-01-14 02:22:55,644 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2019-01-14 02:22:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 3 times [2019-01-14 02:22:55,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:55,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 2 times [2019-01-14 02:22:55,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:55,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1492334512, now seen corresponding path program 4 times [2019-01-14 02:22:55,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:55,961 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-14 02:22:56,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:22:56 BoogieIcfgContainer [2019-01-14 02:22:56,030 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:22:56,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:22:56,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:22:56,031 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:22:56,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:51" (3/4) ... [2019-01-14 02:22:56,036 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:22:56,086 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:22:56,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:22:56,087 INFO L168 Benchmark]: Toolchain (without parser) took 5426.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -243.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:56,090 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:56,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.85 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:56,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:56,097 INFO L168 Benchmark]: Boogie Preprocessor took 24.15 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:56,098 INFO L168 Benchmark]: RCFGBuilder took 256.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:56,098 INFO L168 Benchmark]: BuchiAutomizer took 4777.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:56,099 INFO L168 Benchmark]: Witness Printer took 55.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:56,104 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.85 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.15 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4777.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. * Witness Printer took 55.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * 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) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 50 and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 22 SDslu, 3 SDs, 0 SdLazy, 39 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax250 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf91 smp100 dnf100 smp100 tf118 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=49} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 Loop: [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...