./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-2e94e6a [2019-01-01 21:39:32,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:39:32,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:39:32,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:39:32,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:39:32,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:39:32,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:39:32,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:39:32,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:39:32,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:39:32,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:39:32,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:39:32,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:39:32,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:39:32,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:39:32,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:39:32,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:39:32,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:39:32,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:39:32,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:39:32,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:39:32,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:39:32,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:39:32,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:39:32,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:39:32,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:39:32,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:39:32,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:39:32,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:39:32,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:39:32,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:39:32,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:39:32,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:39:32,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:39:32,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:39:32,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:39:32,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:39:32,742 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:39:32,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:39:32,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:39:32,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:39:32,746 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:39:32,746 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:39:32,746 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:39:32,747 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:39:32,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:39:32,747 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:39:32,747 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:39:32,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:39:32,747 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:39:32,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:39:32,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:39:32,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:39:32,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:39:32,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:39:32,753 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:39:32,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:39:32,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:39:32,753 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:39:32,754 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:39:32,754 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-01 21:39:32,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:39:32,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:39:32,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:39:32,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:39:32,839 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:39:32,839 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-01 21:39:32,895 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cad7a11/1ce0234bb7524b778326e57c6e131dc3/FLAGfe46faf05 [2019-01-01 21:39:33,423 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:39:33,424 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2019-01-01 21:39:33,430 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cad7a11/1ce0234bb7524b778326e57c6e131dc3/FLAGfe46faf05 [2019-01-01 21:39:33,770 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cad7a11/1ce0234bb7524b778326e57c6e131dc3 [2019-01-01 21:39:33,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:39:33,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:39:33,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:33,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:39:33,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:39:33,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:33" (1/1) ... [2019-01-01 21:39:33,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:33, skipping insertion in model container [2019-01-01 21:39:33,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:33" (1/1) ... [2019-01-01 21:39:33,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:39:33,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:39:34,074 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:34,081 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:39:34,103 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:34,121 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:39:34,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34 WrapperNode [2019-01-01 21:39:34,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:34,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:34,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:39:34,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:39:34,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:34,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:39:34,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:39:34,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:39:34,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... [2019-01-01 21:39:34,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:39:34,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:39:34,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:39:34,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:39:34,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:39:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:39:34,530 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:39:34,530 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:39:34,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:34 BoogieIcfgContainer [2019-01-01 21:39:34,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:39:34,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:39:34,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:39:34,537 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:39:34,538 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:34,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:39:33" (1/3) ... [2019-01-01 21:39:34,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c760af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:34, skipping insertion in model container [2019-01-01 21:39:34,539 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:34,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:34" (2/3) ... [2019-01-01 21:39:34,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c760af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:34, skipping insertion in model container [2019-01-01 21:39:34,540 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:34,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:34" (3/3) ... [2019-01-01 21:39:34,543 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_23_false-termination_true-no-overflow.c [2019-01-01 21:39:34,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:39:34,611 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:39:34,611 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:39:34,611 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:39:34,612 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:39:34,612 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:39:34,612 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:39:34,612 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:39:34,612 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:39:34,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:39:34,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:34,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:34,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:34,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:34,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:39:34,663 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:39:34,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:39:34,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:34,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:34,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:34,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:34,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:39:34,674 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-01 21:39:34,674 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-01 21:39:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:39:34,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:34,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:34,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:34,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:39:34,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:39:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:34,961 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-01 21:39:35,042 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:35,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:35,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:35,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:35,046 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:35,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:35,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:35,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:35,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:35,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:35,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:35,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-01 21:39:35,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:35,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:35,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:35,255 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-01 21:39:35,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:35,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:35,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:35,298 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-01 21:39:35,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:35,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:35,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:35,327 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-01 21:39:35,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:35,333 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-01 21:39:35,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:35,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:35,417 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:35,419 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:35,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:35,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:35,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:35,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:35,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:35,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:35,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:35,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:35,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:35,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:35,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:35,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:35,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:35,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:35,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:35,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:35,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:35,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:35,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:35,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:35,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:35,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:35,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:35,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:35,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:35,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:35,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:35,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:35,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:35,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:35,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:35,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:35,687 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:35,687 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:35,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:35,690 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:35,690 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:35,691 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-01 21:39:35,692 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:35,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:35,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:35,827 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-01 21:39:35,829 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:39:36,017 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-01 21:39:36,018 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-01 21:39:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:39:36,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:39:36,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:39:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:39:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:39:36,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:36,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:39:36,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:39:36,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:39:36,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:39:36,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:36,047 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:39:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:39:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:39:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:39:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:39:36,087 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:39:36,087 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:39:36,088 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:39:36,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:39:36,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:36,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:36,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:36,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:39:36,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:39:36,090 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-01 21:39:36,090 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-01 21:39:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:39:36,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:36,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 21:39:36,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:39:36,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:36,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:36,344 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:36,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:36,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:36,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:36,344 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:36,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:36,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:36,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:36,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:39:36,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:36,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:36,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:36,543 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-01 21:39:36,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:36,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:36,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:36,569 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-01 21:39:36,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:36,574 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-01 21:39:36,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:36,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:36,651 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:36,653 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:36,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:36,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:36,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:36,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:36,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:36,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:36,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:36,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:39:36,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:36,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:36,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:36,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:36,744 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:36,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:36,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:36,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:36,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:36,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:36,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:36,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:36,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:36,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:36,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:36,762 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:36,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:36,762 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:36,763 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:36,763 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-01 21:39:36,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:36,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:36,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:36,850 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-01 21:39:36,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:39:36,868 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-01 21:39:36,869 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-01 21:39:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:39:36,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:39:36,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:39:36,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:39:36,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:36,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:39:36,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:36,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:39:36,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:39:36,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:39:36,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:39:36,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:36,874 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:39:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:39:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:39:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:39:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:39:36,877 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:39:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:39:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:39:36,882 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2019-01-01 21:39:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:36,903 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-01-01 21:39:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:39:36,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-01 21:39:36,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:36,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-01 21:39:36,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:39:36,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:39:36,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:39:36,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:36,908 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:39:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:39:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 21:39:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:39:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 21:39:36,911 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:39:36,911 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:39:36,911 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:39:36,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 21:39:36,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:39:36,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:36,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:36,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2019-01-01 21:39:36,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:39:36,913 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-01 21:39:36,913 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-01 21:39:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2019-01-01 21:39:36,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:36,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:36,942 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-01 21:39:36,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:36,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:39:36,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:39:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-01 21:39:36,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:36,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:37,122 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-01 21:39:37,205 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:37,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:37,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:37,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:37,206 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:37,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:37,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:37,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:37,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:39:37,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:37,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:37,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:37,516 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-01 21:39:37,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:37,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:37,541 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:37,542 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-01 21:39:37,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:37,551 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-01 21:39:37,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:37,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:37,636 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:37,638 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:37,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:37,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:37,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:37,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:37,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:37,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:37,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:37,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:39:37,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:37,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:37,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:37,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:37,803 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:37,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:37,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:37,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:37,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:37,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:37,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:37,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:37,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:37,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:37,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:37,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:37,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:37,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:37,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:37,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:37,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:37,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:37,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:37,834 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:39:37,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:37,835 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:37,835 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:37,835 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-01 21:39:37,836 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:37,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:37,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:37,908 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-01 21:39:37,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:39:37,950 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-01 21:39:37,952 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-01 21:39:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:39:37,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:39:37,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:37,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:37,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:37,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:37,996 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-01 21:39:37,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:39:38,008 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-01 21:39:38,009 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-01 21:39:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:39:38,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:39:38,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:38,011 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:39:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:38,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:38,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:38,051 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-01 21:39:38,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:39:38,072 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-01 21:39:38,074 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-01 21:39:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:39:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:39:38,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:39:38,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:38,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:39:38,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:38,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:39:38,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:38,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-01-01 21:39:38,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:39:38,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2019-01-01 21:39:38,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:39:38,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:39:38,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-01 21:39:38,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:38,079 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-01 21:39:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-01 21:39:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2019-01-01 21:39:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:39:38,081 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:39:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:39:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:39:38,082 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2019-01-01 21:39:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:38,103 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-01 21:39:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:39:38,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-01 21:39:38,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:39:38,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2019-01-01 21:39:38,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:39:38,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:39:38,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 21:39:38,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:38,107 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:39:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 21:39:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2019-01-01 21:39:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:39:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-01 21:39:38,108 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-01 21:39:38,108 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-01 21:39:38,108 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:39:38,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-01-01 21:39:38,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:39:38,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:38,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:38,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:38,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:39:38,110 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-01 21:39:38,110 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-01 21:39:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:39:38,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:38,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 1 times [2019-01-01 21:39:38,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:38,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 2 times [2019-01-01 21:39:38,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:38,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:38,212 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:38,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:38,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:38,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:38,214 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:38,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:38,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:38,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:38,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:39:38,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:38,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:38,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:38,343 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-01 21:39:38,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:38,349 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-01 21:39:38,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:38,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:38,408 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:38,411 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:38,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:38,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:38,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:38,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:38,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:38,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:38,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:38,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:39:38,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:38,412 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:38,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:38,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:38,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:38,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:38,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:38,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:38,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:38,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:38,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:38,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:38,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:38,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:38,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:38,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:38,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:38,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:38,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,610 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 21:39:38,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,617 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,617 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,644 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,645 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:38,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,659 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:39:38,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:38,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,665 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,665 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,676 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 21:39:38,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:38,685 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:38,687 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:38,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:38,752 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:38,753 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:38,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:38,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:38,769 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:38,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:38,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:38,782 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:38,782 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:38,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,788 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 21:39:38,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:38,796 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:38,796 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:38,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:38,819 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:38,820 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:38,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:38,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:38,833 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 21:39:38,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:38,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:38,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:38,840 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:38,840 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:38,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,851 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 21:39:38,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:38,856 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:38,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,860 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,861 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:38,896 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:38,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,900 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,908 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:38,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:38,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:38,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:39:38,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:38,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:38,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:38,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:38,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:39:38,936 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:39:38,937 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:39:38,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:38,948 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 21:39:38,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-01 21:39:38,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:38,950 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 21:39:38,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:38,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:38,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:38,959 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:38,959 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,016 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 21:39:39,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,021 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:39,022 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,040 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 21:39:39,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:39,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,045 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:39,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:39,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,056 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 21:39:39,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,058 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:39,058 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,074 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 21:39:39,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,075 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,075 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:39,082 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:39,083 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:39,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,130 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:39,135 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:39,137 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:39,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:39,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:39,157 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 21:39:39,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:39,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 21:39:39,170 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 21:39:39,170 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-01-01 21:39:39,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,186 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 21:39:39,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,188 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:39,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,195 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:39,196 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,225 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:39,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,226 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,231 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:39,231 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,241 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:39,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:39,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:39:39,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:39,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 21:39:39,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 21:39:39,257 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:39:39,258 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:39:39,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,263 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 21:39:39,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,265 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,270 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 21:39:39,276 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 21:39:39,276 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-01 21:39:39,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,346 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,347 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 21:39:39,351 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 21:39:39,352 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-01 21:39:39,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:39,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,361 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 21:39:39,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:39,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:39,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:39:39,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 21:39:39,374 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 21:39:39,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:39,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:39,376 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 21:39:39,379 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 21:39:39,379 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-01 21:39:39,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:39,387 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2019-01-01 21:39:39,387 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-01 21:39:39,387 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-01 21:39:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 3 times [2019-01-01 21:39:39,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 2 times [2019-01-01 21:39:39,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:39,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:39,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1492334512, now seen corresponding path program 4 times [2019-01-01 21:39:39,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:39,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:39,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:39,667 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 21:39:39,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:39:39 BoogieIcfgContainer [2019-01-01 21:39:39,841 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:39:39,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:39:39,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:39:39,842 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:39:39,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:34" (3/4) ... [2019-01-01 21:39:39,846 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:39:39,895 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:39:39,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:39:39,896 INFO L168 Benchmark]: Toolchain (without parser) took 6119.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.0 MB in the beginning and 810.0 MB in the end (delta: 140.0 MB). Peak memory consumption was 266.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:39,897 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:39,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:39,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.06 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:39,899 INFO L168 Benchmark]: Boogie Preprocessor took 27.50 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:39,901 INFO L168 Benchmark]: RCFGBuilder took 335.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:39,903 INFO L168 Benchmark]: BuchiAutomizer took 5309.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.0 MB in the end (delta: 296.7 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:39,905 INFO L168 Benchmark]: Witness Printer took 53.68 ms. Allocated memory is still 1.2 GB. Free memory is still 810.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:39,909 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.19 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 343.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.06 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.50 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 335.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5309.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.0 MB in the end (delta: 296.7 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.68 ms. Allocated memory is still 1.2 GB. Free memory is still 810.0 MB. There was no memory consumed. 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 5.2s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. 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.2s 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: 20ms 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...