./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_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 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:54:59,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:54:59,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:54:59,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:54:59,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:54:59,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:54:59,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:54:59,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:54:59,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:54:59,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:54:59,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:54:59,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:54:59,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:54:59,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:54:59,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:54:59,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:54:59,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:54:59,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:54:59,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:54:59,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:54:59,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:54:59,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:54:59,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:54:59,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:54:59,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:54:59,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:54:59,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:54:59,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:54:59,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:54:59,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:54:59,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:54:59,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:54:59,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:54:59,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:54:59,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:54:59,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:54:59,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:54:59,704 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:54:59,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:54:59,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:54:59,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:54:59,708 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:54:59,708 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:54:59,708 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:54:59,709 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:54:59,709 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:54:59,709 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:54:59,709 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:54:59,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:54:59,709 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:54:59,710 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:54:59,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:54:59,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:54:59,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:54:59,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:54:59,711 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:54:59,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:54:59,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:54:59,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:54:59,712 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:54:59,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:54:59,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:54:59,713 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:54:59,714 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:54:59,714 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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2019-01-01 23:54:59,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:54:59,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:54:59,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:54:59,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:54:59,822 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:54:59,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-01 23:54:59,919 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c122ecd/d9f00778b5cb4121bb0d09d24eb22253/FLAGa77919bfe [2019-01-01 23:55:00,561 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:55:00,563 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-01 23:55:00,573 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c122ecd/d9f00778b5cb4121bb0d09d24eb22253/FLAGa77919bfe [2019-01-01 23:55:00,879 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c122ecd/d9f00778b5cb4121bb0d09d24eb22253 [2019-01-01 23:55:00,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:55:00,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:55:00,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:55:00,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:55:00,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:55:00,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:55:00" (1/1) ... [2019-01-01 23:55:00,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc52f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:00, skipping insertion in model container [2019-01-01 23:55:00,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:55:00" (1/1) ... [2019-01-01 23:55:00,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:55:00,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:55:01,189 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:55:01,196 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:55:01,221 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:55:01,245 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:55:01,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01 WrapperNode [2019-01-01 23:55:01,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:55:01,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:55:01,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:55:01,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:55:01,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:55:01,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:55:01,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:55:01,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:55:01,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... [2019-01-01 23:55:01,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:55:01,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:55:01,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:55:01,353 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:55:01,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:55:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:55:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-01 23:55:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-01 23:55:01,959 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:55:01,959 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:55:01,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:55:01 BoogieIcfgContainer [2019-01-01 23:55:01,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:55:01,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:55:01,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:55:01,968 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:55:01,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:55:01,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:55:00" (1/3) ... [2019-01-01 23:55:01,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbd2f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:55:01, skipping insertion in model container [2019-01-01 23:55:01,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:55:01,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:55:01" (2/3) ... [2019-01-01 23:55:01,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbd2f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:55:01, skipping insertion in model container [2019-01-01 23:55:01,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:55:01,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:55:01" (3/3) ... [2019-01-01 23:55:01,979 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2019-01-01 23:55:02,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:55:02,100 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:55:02,101 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:55:02,101 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:55:02,101 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:55:02,102 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:55:02,102 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:55:02,102 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:55:02,102 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:55:02,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 23:55:02,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:02,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:02,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:02,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:55:02,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:55:02,208 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:55:02,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 23:55:02,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:02,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:02,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:02,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:55:02,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:55:02,235 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-01 23:55:02,236 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-01-01 23:55:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-01 23:55:02,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:02,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:02,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-01 23:55:02,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-01 23:55:02,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:02,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:02,695 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:02,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:02,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:02,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:02,698 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:02,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:02,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:02,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:02,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:55:02,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:02,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:02,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:02,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:02,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:02,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-01 23:55:02,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:02,983 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 23:55:03,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:03,088 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) [2019-01-01 23:55:03,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:03,109 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:03,139 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=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) [2019-01-01 23:55:03,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:03,188 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:03,201 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:03,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:03,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:03,256 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=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-01 23:55:03,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:03,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:03,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:03,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:03,312 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:03,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:03,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:03,402 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:03,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:03,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:03,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:03,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:03,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:03,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:03,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:03,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:55:03,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:03,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:03,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:03,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:03,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:03,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:03,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:03,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:03,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:03,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:03,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:03,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:03,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:03,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:03,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:03,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:03,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:03,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:03,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:03,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:03,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:03,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:03,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:03,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:03,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:03,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:03,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:03,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:03,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:03,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:03,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:03,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:03,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:03,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:03,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:03,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:03,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:03,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:03,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:03,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:03,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:03,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:03,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:03,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:03,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:03,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:03,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:03,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:03,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:03,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:03,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:03,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:03,669 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:03,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:03,677 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:03,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:03,681 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:03,681 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:03,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-01 23:55:03,684 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:04,273 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-01 23:55:04,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-01 23:55:04,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-01-01 23:55:04,746 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-01 23:55:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:55:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 23:55:04,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 23:55:04,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:04,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 23:55:04,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:04,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 23:55:04,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:04,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-01 23:55:04,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:04,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-01 23:55:04,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 23:55:04,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 23:55:04,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-01 23:55:04,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:04,781 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 23:55:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-01 23:55:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-01 23:55:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 23:55:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-01 23:55:04,822 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 23:55:04,823 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 23:55:04,823 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:55:04,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-01 23:55:04,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:04,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:04,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:04,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:04,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:04,828 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-01 23:55:04,828 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-01-01 23:55:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-01 23:55:04,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:04,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:55:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:55:04,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-01 23:55:05,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:05,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:55:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:55:05,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:55:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:55:05,092 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 23:55:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:05,504 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-01 23:55:05,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:55:05,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-01 23:55:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:05,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-01 23:55:05,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 23:55:05,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 23:55:05,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-01 23:55:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:05,514 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:55:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-01 23:55:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 23:55:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 23:55:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-01 23:55:05,523 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:55:05,523 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:55:05,523 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:55:05,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-01 23:55:05,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:55:05,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:05,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:05,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:05,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:05,531 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-01 23:55:05,532 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2019-01-01 23:55:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,532 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-01 23:55:05,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:05,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:05,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:05,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:05,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:05,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 23:55:05,977 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-01 23:55:05,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:05,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:05,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:06,260 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:06,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:06,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:06,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:06,262 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:06,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:06,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:06,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:06,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:55:06,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:06,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:06,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:06,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:06,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:06,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:06,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:06,446 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:06,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:06,450 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:06,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:06,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:07,230 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:07,233 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:07,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:07,233 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:07,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:07,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:07,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:07,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:07,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:07,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:55:07,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:07,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:07,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:07,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:07,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:07,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:07,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:07,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:07,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:07,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:07,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:07,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:07,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:07,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:07,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:07,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:07,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:07,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:07,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:07,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:07,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:07,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:07,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:07,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:07,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:07,444 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:07,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:07,458 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:07,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:07,459 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:07,459 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:07,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:55:07,460 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:07,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:07,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:07,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:07,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-01 23:55:08,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-01-01 23:55:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-01 23:55:08,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 23:55:08,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:08,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-01 23:55:08,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:08,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-01 23:55:08,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:08,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-01 23:55:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:55:08,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-01 23:55:08,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-01 23:55:08,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:55:08,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-01 23:55:08,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:08,166 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-01 23:55:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-01 23:55:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-01 23:55:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 23:55:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-01 23:55:08,189 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-01 23:55:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:55:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:55:08,190 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-01 23:55:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:08,360 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-01 23:55:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:55:08,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-01 23:55:08,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:55:08,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-01 23:55:08,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-01 23:55:08,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:55:08,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-01 23:55:08,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:08,375 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-01 23:55:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-01 23:55:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-01 23:55:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 23:55:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-01 23:55:08,395 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-01 23:55:08,395 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-01 23:55:08,395 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:55:08,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-01 23:55:08,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:55:08,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:08,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:08,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:08,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:08,405 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-01 23:55:08,405 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2019-01-01 23:55:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-01 23:55:08,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:08,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:08,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:08,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 23:55:08,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:08,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:08,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:08,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 23:55:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:08,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 23:55:08,631 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-01 23:55:08,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:08,821 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:08,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:08,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:08,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:08,822 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:08,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:08,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:08,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-01 23:55:08,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:08,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:08,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,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-01 23:55:08,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-01 23:55:08,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:08,947 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,953 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:08,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:09,745 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:09,748 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:09,749 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:09,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:09,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:09,749 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:09,749 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:09,749 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:09,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:09,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-01 23:55:09,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:09,750 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:09,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,847 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:09,847 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:09,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:09,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:09,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:09,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:09,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:09,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:09,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:09,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:09,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:09,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:09,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:09,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:09,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:09,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:09,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:09,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:09,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:09,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:09,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:09,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:09,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:09,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:09,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:09,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:09,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:09,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:09,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:09,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:09,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:09,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:09,876 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:09,876 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:09,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:09,877 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:09,877 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:09,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:55:09,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:09,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:10,149 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:10,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:55:10,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2019-01-01 23:55:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-01 23:55:10,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:55:10,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:10,440 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:10,634 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:10,634 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:55:10,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2019-01-01 23:55:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-01 23:55:10,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:55:10,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:10,880 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,204 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:55:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:11,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:11,347 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:11,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:55:12,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2019-01-01 23:55:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-01 23:55:12,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:55:12,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:12,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-01 23:55:12,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:12,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-01 23:55:12,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:12,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-01 23:55:12,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-01 23:55:12,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-01 23:55:12,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-01 23:55:12,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-01 23:55:12,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-01 23:55:12,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:12,243 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-01 23:55:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-01 23:55:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-01 23:55:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-01 23:55:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-01 23:55:12,289 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-01 23:55:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:55:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:55:12,290 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-01 23:55:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:13,048 INFO L93 Difference]: Finished difference Result 497 states and 787 transitions. [2019-01-01 23:55:13,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:55:13,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 787 transitions. [2019-01-01 23:55:13,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-01 23:55:13,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 784 transitions. [2019-01-01 23:55:13,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-01 23:55:13,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-01 23:55:13,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 784 transitions. [2019-01-01 23:55:13,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:13,088 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 784 transitions. [2019-01-01 23:55:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 784 transitions. [2019-01-01 23:55:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 365. [2019-01-01 23:55:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-01 23:55:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 517 transitions. [2019-01-01 23:55:13,168 INFO L728 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-01 23:55:13,168 INFO L608 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-01 23:55:13,168 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:55:13,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 517 transitions. [2019-01-01 23:55:13,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:13,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:13,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:13,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:13,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:55:13,175 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3586#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3597#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3594#L6 assume !(~n < 1); 3595#L8 assume !(1 == ~n); 3555#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3591#L6 assume !(~n < 1); 3593#L8 assume !(1 == ~n); 3554#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3590#L6 assume !(~n < 1); 3553#L8 assume 1 == ~n;#res := 1; 3556#fiboFINAL assume true; 3672#fiboEXIT >#32#return; 3617#L11-1 call #t~ret1 := fibo(~n - 2);< 3618#fiboENTRY ~n := #in~n; 3739#L6 assume !(~n < 1); 3736#L8 assume !(1 == ~n); 3737#L11 call #t~ret0 := fibo(~n - 1);< 3749#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3863#L8 assume !(1 == ~n); 3666#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-01 23:55:13,176 INFO L796 eck$LassoCheckResult]: Loop: 3872#fiboENTRY ~n := #in~n; 3879#L6 assume !(~n < 1); 3878#L8 assume !(1 == ~n); 3667#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-01 23:55:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-01 23:55:13,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:13,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:13,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:13,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:13,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:13,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:13,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:13,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-01-01 23:55:13,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-01 23:55:13,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:13,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:13,799 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:13,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:13,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:13,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:13,800 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:13,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:13,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:13,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:13,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:55:13,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:13,801 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:13,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-01 23:55:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:13,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:13,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:13,869 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:13,869 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01 23:55:13,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:13,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:13,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:13,879 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=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-01 23:55:13,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:13,905 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-01 23:55:13,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:13,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:13,983 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:13,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:13,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:13,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:13,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:13,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:13,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:13,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:13,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:13,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:55:13,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:13,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:14,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:14,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:14,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:14,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:14,094 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:14,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:14,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:14,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:14,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:14,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:14,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:14,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:14,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:14,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:14,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:14,104 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:14,105 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:14,105 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:14,105 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:14,106 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:14,106 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-01 23:55:14,106 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:14,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:14,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:14,378 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-01 23:55:14,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-01 23:55:14,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-01 23:55:14,499 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-01 23:55:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:55:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 23:55:14,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:55:14,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:14,504 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:14,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:14,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:14,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:55:14,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-01 23:55:14,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-01 23:55:14,765 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-01 23:55:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:55:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 23:55:14,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:55:14,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:14,767 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:14,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:15,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:15,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:15,085 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:55:15,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-01 23:55:15,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 492 states and 654 transitions. Complement of second has 14 states. [2019-01-01 23:55:15,206 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-01 23:55:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:55:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 23:55:15,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:55:15,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:15,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-01 23:55:15,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:15,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-01 23:55:15,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:15,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 654 transitions. [2019-01-01 23:55:15,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:15,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 405 states and 565 transitions. [2019-01-01 23:55:15,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-01 23:55:15,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2019-01-01 23:55:15,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 565 transitions. [2019-01-01 23:55:15,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:15,237 INFO L705 BuchiCegarLoop]: Abstraction has 405 states and 565 transitions. [2019-01-01 23:55:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 565 transitions. [2019-01-01 23:55:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 389. [2019-01-01 23:55:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-01 23:55:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 541 transitions. [2019-01-01 23:55:15,267 INFO L728 BuchiCegarLoop]: Abstraction has 389 states and 541 transitions. [2019-01-01 23:55:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 23:55:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-01-01 23:55:15,268 INFO L87 Difference]: Start difference. First operand 389 states and 541 transitions. Second operand 20 states. [2019-01-01 23:55:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:16,645 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2019-01-01 23:55:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 23:55:16,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2019-01-01 23:55:16,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:16,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2019-01-01 23:55:16,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:55:16,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:55:16,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:55:16,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:55:16,655 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:16,655 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:16,655 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:16,655 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:55:16,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:55:16,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:16,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:55:16,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:55:16 BoogieIcfgContainer [2019-01-01 23:55:16,666 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:55:16,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:55:16,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:55:16,668 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:55:16,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:55:01" (3/4) ... [2019-01-01 23:55:16,675 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:55:16,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:55:16,676 INFO L168 Benchmark]: Toolchain (without parser) took 15787.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 943.3 MB in the beginning and 761.5 MB in the end (delta: 181.8 MB). Peak memory consumption was 381.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:16,677 INFO L168 Benchmark]: CDTParser took 0.19 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-01 23:55:16,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.97 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:16,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.91 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:16,679 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:16,680 INFO L168 Benchmark]: RCFGBuilder took 607.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:16,681 INFO L168 Benchmark]: BuchiAutomizer took 14704.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 761.5 MB in the end (delta: 316.5 MB). Peak memory consumption was 405.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:16,682 INFO L168 Benchmark]: Witness Printer took 7.94 ms. Allocated memory is still 1.2 GB. Free memory is still 761.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:16,687 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.97 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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 62.91 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 607.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14704.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 761.5 MB in the end (delta: 316.5 MB). Peak memory consumption was 405.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.94 ms. Allocated memory is still 1.2 GB. Free memory is still 761.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 (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.6s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 6.1s. Construction of modules took 2.3s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 365 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 149 SDtfs, 379 SDslu, 185 SDs, 0 SdLazy, 716 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...