./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash a755472942b72da612d26a2f3af20ed4332f07b5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:11,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:11,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:11,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:11,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:11,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:11,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:11,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:11,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:11,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:11,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:11,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:11,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:11,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:11,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:11,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:11,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:11,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:11,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:11,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:11,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:11,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:11,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:11,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:11,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:11,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:11,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:11,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:11,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:11,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:11,687 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:11,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:11,688 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:11,688 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:11,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:11,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:11,691 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:33:11,722 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:11,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:11,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:11,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:11,726 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:11,727 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:11,727 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:11,727 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:11,727 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:11,727 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:11,728 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:11,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:11,732 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:11,733 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:11,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:11,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:11,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:11,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:11,734 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:11,735 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:11,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:11,738 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:11,738 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:11,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:11,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:11,739 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:11,740 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:11,742 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a755472942b72da612d26a2f3af20ed4332f07b5 [2019-01-14 04:33:11,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:11,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:11,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:11,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:11,817 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:11,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:11,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9381cd05b/c885b1a92e2f474196eae88c1ee8a384/FLAGf1e07c603 [2019-01-14 04:33:12,332 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:12,333 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:12,338 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9381cd05b/c885b1a92e2f474196eae88c1ee8a384/FLAGf1e07c603 [2019-01-14 04:33:12,707 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9381cd05b/c885b1a92e2f474196eae88c1ee8a384 [2019-01-14 04:33:12,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:12,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:12,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:12,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:12,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:12,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:12,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12, skipping insertion in model container [2019-01-14 04:33:12,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:12,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:12,756 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:12,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:12,938 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:12,957 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:12,975 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:12,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12 WrapperNode [2019-01-14 04:33:12,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:12,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:12,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:12,977 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:12,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:12,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:13,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:13,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:13,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:13,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... [2019-01-14 04:33:13,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:13,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:13,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:13,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:13,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-01-14 04:33:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-01-14 04:33:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:13,580 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:13,580 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:13,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:13 BoogieIcfgContainer [2019-01-14 04:33:13,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:13,582 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:13,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:13,587 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:13,588 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:13,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:12" (1/3) ... [2019-01-14 04:33:13,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22781d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:13, skipping insertion in model container [2019-01-14 04:33:13,590 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:13,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:12" (2/3) ... [2019-01-14 04:33:13,590 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22781d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:13, skipping insertion in model container [2019-01-14 04:33:13,590 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:13,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:13" (3/3) ... [2019-01-14 04:33:13,593 INFO L375 chiAutomizerObserver]: Analyzing ICFG MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:13,653 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:13,653 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:13,653 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:13,654 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:13,654 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:13,654 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:13,654 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:13,654 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:13,654 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:13,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 04:33:13,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:13,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:13,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:13,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:33:13,712 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:33:13,712 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:13,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 04:33:13,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:13,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:13,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:13,717 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:33:13,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:33:13,726 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L27true assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 10#L31true assume !(main_~n~0 < 0 || main_~n~0 > 46340); 16#L34true call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 4#multENTRYtrue [2019-01-14 04:33:13,727 INFO L796 eck$LassoCheckResult]: Loop: 4#multENTRYtrue ~n := #in~n;~m := #in~m; 6#L16true assume ~m < 0; 3#L17true call #t~ret0 := mult(~n, -~m);< 4#multENTRYtrue [2019-01-14 04:33:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 1 times [2019-01-14 04:33:13,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 1 times [2019-01-14 04:33:13,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:13,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:13,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1527521652, now seen corresponding path program 1 times [2019-01-14 04:33:13,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:13,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:13,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:14,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:14,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:14,180 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:14,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:14,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:14,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:14,183 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:14,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:14,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:14,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:14,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:14,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:14,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:14,556 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,575 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,620 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,620 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,647 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-14 04:33:14,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,710 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,718 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:14,759 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:14,784 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:14,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:14,840 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:14,842 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:14,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:14,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:14,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:14,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:14,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:14,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:14,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:14,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:14,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:14,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:14,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:14,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:15,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:15,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:15,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:15,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:15,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:15,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:15,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:15,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:15,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:15,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:15,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:15,162 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 04:33:15,162 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:33:15,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:15,165 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:15,165 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:15,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-14 04:33:15,167 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:15,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:15,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:15,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:33:15,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2019-01-14 04:33:15,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 50 states and 65 transitions. Complement of second has 12 states. [2019-01-14 04:33:15,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 04:33:16,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 04:33:16,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:16,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:33:16,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:16,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 04:33:16,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:16,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-01-14 04:33:16,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:16,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 31 states and 44 transitions. [2019-01-14 04:33:16,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 04:33:16,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 04:33:16,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2019-01-14 04:33:16,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:16,047 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-14 04:33:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2019-01-14 04:33:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-14 04:33:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 04:33:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-01-14 04:33:16,095 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-14 04:33:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:33:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:33:16,102 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2019-01-14 04:33:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:16,247 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-01-14 04:33:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:16,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-14 04:33:16,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:16,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 33 transitions. [2019-01-14 04:33:16,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 04:33:16,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 04:33:16,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-14 04:33:16,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:16,255 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 04:33:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-14 04:33:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-01-14 04:33:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:33:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-14 04:33:16,259 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-14 04:33:16,260 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-14 04:33:16,260 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:16,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-14 04:33:16,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:16,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:16,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:16,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:16,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:33:16,262 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 197#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 198#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 192#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 191#multENTRY ~n := #in~n;~m := #in~m; 193#L16 assume !(~m < 0); 194#L19 assume !(0 == ~m); 187#L22 call #t~ret1 := mult(~n, ~m - 1);< 190#multENTRY [2019-01-14 04:33:16,262 INFO L796 eck$LassoCheckResult]: Loop: 190#multENTRY ~n := #in~n;~m := #in~m; 205#L16 assume ~m < 0; 186#L17 call #t~ret0 := mult(~n, -~m);< 190#multENTRY [2019-01-14 04:33:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 1 times [2019-01-14 04:33:16,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 2 times [2019-01-14 04:33:16,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:16,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:16,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash 924096870, now seen corresponding path program 1 times [2019-01-14 04:33:16,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:16,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:16,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:16,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:16,476 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:16,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:16,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:16,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:16,477 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:16,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:16,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:16,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:16,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:16,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:16,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,579 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:16,579 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,610 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,611 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,659 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,659 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,683 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,684 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,712 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,712 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,734 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:16,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,782 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:16,783 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:16,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:16,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:16,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:16,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:16,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:16,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:16,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:16,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:16,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:16,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:16,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:16,908 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:16,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:16,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:16,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:16,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:16,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:16,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:16,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,946 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:16,950 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 04:33:16,950 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:33:16,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:16,951 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:16,952 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:16,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-14 04:33:16,952 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:17,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:17,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:17,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:33:17,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:33:17,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 72 states and 91 transitions. Complement of second has 15 states. [2019-01-14 04:33:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 04:33:17,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 04:33:17,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 04:33:17,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 04:33:17,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. [2019-01-14 04:33:17,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 04:33:17,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 50 states and 65 transitions. [2019-01-14 04:33:17,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-01-14 04:33:17,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-14 04:33:17,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2019-01-14 04:33:17,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:17,361 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-01-14 04:33:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2019-01-14 04:33:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-01-14 04:33:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 04:33:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-01-14 04:33:17,368 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-14 04:33:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:33:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:33:17,370 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 5 states. [2019-01-14 04:33:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:17,455 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-01-14 04:33:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:33:17,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2019-01-14 04:33:17,460 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:33:17,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 47 transitions. [2019-01-14 04:33:17,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 04:33:17,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-14 04:33:17,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2019-01-14 04:33:17,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:17,464 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 04:33:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2019-01-14 04:33:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 04:33:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 04:33:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-14 04:33:17,471 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 04:33:17,472 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 04:33:17,472 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:17,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2019-01-14 04:33:17,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:33:17,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:17,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:17,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:17,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:33:17,477 INFO L794 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 458#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 459#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 460#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 467#multENTRY ~n := #in~n;~m := #in~m; 479#L16 assume !(~m < 0); 476#L19 assume 0 == ~m;#res := 0; 475#multFINAL assume true; 469#multEXIT >#45#return; 466#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 451#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 452#multENTRY [2019-01-14 04:33:17,477 INFO L796 eck$LassoCheckResult]: Loop: 452#multENTRY ~n := #in~n;~m := #in~m; 474#L16 assume ~m < 0; 450#L17 call #t~ret0 := mult(~n, -~m);< 452#multENTRY [2019-01-14 04:33:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 1 times [2019-01-14 04:33:17,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 3 times [2019-01-14 04:33:17,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1370471320, now seen corresponding path program 1 times [2019-01-14 04:33:17,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:17,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:17,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:17,624 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:17,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:17,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:17,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:17,625 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:17,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:17,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:17,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:17,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:17,626 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:17,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:17,713 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:17,720 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:17,742 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:17,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:17,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:17,811 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:17,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:17,861 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:17,863 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:17,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:17,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:17,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:17,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:17,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:17,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:17,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:17,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:17,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:17,864 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:17,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:17,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:17,948 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:17,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:17,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:17,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:17,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:17,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:17,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:17,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:17,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:17,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:17,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:17,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:17,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:17,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:17,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:17,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:17,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:17,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:17,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:17,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:17,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:17,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:17,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:17,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:17,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:17,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:17,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:17,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:17,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:17,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:17,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:17,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:17,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:17,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:17,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:17,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:17,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:17,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:17,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:17,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:17,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:17,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:17,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:17,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:17,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:17,981 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:17,983 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 04:33:17,984 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:33:17,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:17,984 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:17,984 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:17,985 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-14 04:33:17,986 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:18,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:18,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:18,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:33:18,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 04:33:18,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 81 states and 90 transitions. Complement of second has 14 states. [2019-01-14 04:33:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:33:18,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 04:33:18,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:18,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:33:18,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:18,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 04:33:18,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:18,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 90 transitions. [2019-01-14 04:33:18,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 04:33:18,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 62 states and 70 transitions. [2019-01-14 04:33:18,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-14 04:33:18,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-14 04:33:18,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2019-01-14 04:33:18,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:18,329 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-14 04:33:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2019-01-14 04:33:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2019-01-14 04:33:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 04:33:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-01-14 04:33:18,336 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-14 04:33:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:33:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:33:18,336 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2019-01-14 04:33:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:18,374 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-14 04:33:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:18,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2019-01-14 04:33:18,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 04:33:18,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 39 transitions. [2019-01-14 04:33:18,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-14 04:33:18,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-14 04:33:18,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2019-01-14 04:33:18,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:18,380 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-01-14 04:33:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2019-01-14 04:33:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-14 04:33:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 04:33:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 04:33:18,385 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 04:33:18,385 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 04:33:18,385 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:18,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-01-14 04:33:18,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 04:33:18,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:18,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:18,389 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:18,390 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:18,390 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 734#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 735#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 742#multENTRY ~n := #in~n;~m := #in~m; 749#L16 assume !(~m < 0); 747#L19 assume 0 == ~m;#res := 0; 746#multFINAL assume true; 745#multEXIT >#45#return; 741#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 729#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 728#multENTRY [2019-01-14 04:33:18,390 INFO L796 eck$LassoCheckResult]: Loop: 728#multENTRY ~n := #in~n;~m := #in~m; 730#L16 assume !(~m < 0); 732#L19 assume !(0 == ~m); 731#L22 call #t~ret1 := mult(~n, ~m - 1);< 728#multENTRY [2019-01-14 04:33:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 2 times [2019-01-14 04:33:18,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 1 times [2019-01-14 04:33:18,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash 465064035, now seen corresponding path program 1 times [2019-01-14 04:33:18,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:18,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,524 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:18,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:18,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:18,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:18,524 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:18,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:18,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:18,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-14 04:33:18,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:18,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:18,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:18,604 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:18,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:18,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:18,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:18,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:18,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:18,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:18,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:18,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:18,665 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:18,685 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:18,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:18,734 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:18,735 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:18,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:18,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:18,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:18,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:18,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:18,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:18,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-14 04:33:18,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:18,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:18,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:18,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:18,920 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:18,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:18,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:18,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:18,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:18,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:18,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:18,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:18,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:18,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:18,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:18,940 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:18,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:18,948 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:18,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:18,950 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:18,950 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:18,950 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2019-01-14 04:33:18,950 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:19,130 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:33:19,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-14 04:33:19,198 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 41 states and 45 transitions. Complement of second has 13 states. [2019-01-14 04:33:19,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 04:33:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 04:33:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 04:33:19,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-14 04:33:19,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-01-14 04:33:19,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:19,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 15 states and 15 transitions. [2019-01-14 04:33:19,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 04:33:19,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 04:33:19,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2019-01-14 04:33:19,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:19,206 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-14 04:33:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2019-01-14 04:33:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 8. [2019-01-14 04:33:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:33:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-14 04:33:19,208 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-14 04:33:19,208 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-14 04:33:19,208 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:19,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2019-01-14 04:33:19,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:19,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:19,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:19,209 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:33:19,209 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:19,209 INFO L794 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 888#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 881#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 882#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 883#multENTRY [2019-01-14 04:33:19,209 INFO L796 eck$LassoCheckResult]: Loop: 883#multENTRY ~n := #in~n;~m := #in~m; 885#L16 assume !(~m < 0); 886#L19 assume !(0 == ~m); 884#L22 call #t~ret1 := mult(~n, ~m - 1);< 883#multENTRY [2019-01-14 04:33:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 2 times [2019-01-14 04:33:19,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 2 times [2019-01-14 04:33:19,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 2 times [2019-01-14 04:33:19,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:19,315 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:19,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:19,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:19,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:19,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:19,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:19,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:19,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-14 04:33:19,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:19,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:19,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:19,402 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:19,409 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:19,435 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:19,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:19,479 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,502 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:19,503 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:19,523 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:19,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,567 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:19,568 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:19,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:19,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:19,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:19,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:19,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:19,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:19,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-14 04:33:19,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:19,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:19,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:19,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:19,681 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:19,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:19,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:19,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:19,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:19,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:19,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:19,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:19,733 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:19,733 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:19,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:19,735 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:19,735 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:19,736 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2019-01-14 04:33:19,736 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:19,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:33:19,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1 Second operand 4 states. [2019-01-14 04:33:19,907 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 18 states and 18 transitions. Complement of second has 11 states. [2019-01-14 04:33:19,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 04:33:19,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 04:33:19,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 04:33:19,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 04:33:19,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 18 transitions. [2019-01-14 04:33:19,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:19,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-14 04:33:19,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:33:19,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:33:19,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:33:19,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:19,912 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:19,912 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:19,912 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:19,912 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:33:19,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:33:19,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:19,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:33:19,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:33:19 BoogieIcfgContainer [2019-01-14 04:33:19,920 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:33:19,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:33:19,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:33:19,920 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:33:19,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:13" (3/4) ... [2019-01-14 04:33:19,924 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:33:19,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:33:19,925 INFO L168 Benchmark]: Toolchain (without parser) took 7213.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 942.0 MB in the beginning and 968.5 MB in the end (delta: -26.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:19,927 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:19,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.43 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:19,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:19,929 INFO L168 Benchmark]: Boogie Preprocessor took 16.14 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:19,929 INFO L168 Benchmark]: RCFGBuilder took 554.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:19,930 INFO L168 Benchmark]: BuchiAutomizer took 6337.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 968.5 MB in the end (delta: 128.9 MB). Peak memory consumption was 205.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:19,931 INFO L168 Benchmark]: Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 968.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:19,936 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.43 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.14 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 554.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6337.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 968.5 MB in the end (delta: 128.9 MB). Peak memory consumption was 205.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 968.5 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 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * \old(m) and consists of 4 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function \old(m) and consists of 5 locations. One deterministic module has affine ranking function \old(m) and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 120 SDtfs, 138 SDslu, 102 SDs, 0 SdLazy, 159 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf94 smp87 dnf100 smp100 tf112 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...