./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_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_2calls_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 fe571d33601eb001defa960d70b02ea99b59263c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:54:26,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:54:26,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:54:26,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:54:26,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:54:26,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:54:26,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:54:26,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:54:26,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:54:26,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:54:26,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:54:26,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:54:26,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:54:26,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:54:26,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:54:26,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:54:26,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:54:26,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:54:26,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:54:26,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:54:26,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:54:26,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:54:26,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:54:26,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:54:26,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:54:26,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:54:26,560 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:54:26,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:54:26,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:54:26,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:54:26,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:54:26,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:54:26,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:54:26,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:54:26,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:54:26,566 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:26,594 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:54:26,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:54:26,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:54:26,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:54:26,596 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:54:26,596 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:54:26,596 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:54:26,596 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:54:26,600 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:54:26,600 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:54:26,601 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:54:26,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:54:26,601 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:54:26,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:54:26,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:54:26,602 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:54:26,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:54:26,604 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:54:26,604 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:54:26,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:54:26,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:54:26,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:54:26,605 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:54:26,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:54:26,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:54:26,606 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:54:26,607 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:54:26,607 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 -> fe571d33601eb001defa960d70b02ea99b59263c [2019-01-01 23:54:26,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:54:26,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:54:26,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:54:26,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:54:26,677 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:54:26,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-01 23:54:26,731 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803957076/0ae8f4bba0a9413c865b00c8a8eabb78/FLAGf54c4b60a [2019-01-01 23:54:27,253 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:54:27,254 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-01 23:54:27,264 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803957076/0ae8f4bba0a9413c865b00c8a8eabb78/FLAGf54c4b60a [2019-01-01 23:54:27,598 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803957076/0ae8f4bba0a9413c865b00c8a8eabb78 [2019-01-01 23:54:27,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:54:27,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:54:27,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:27,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:54:27,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:54:27,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179a4755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27, skipping insertion in model container [2019-01-01 23:54:27,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:54:27,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:54:27,805 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:27,809 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:54:27,827 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:27,840 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:54:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27 WrapperNode [2019-01-01 23:54:27,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:27,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:27,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:54:27,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:54:27,849 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:54:27" (1/1) ... [2019-01-01 23:54:27,854 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:54:27" (1/1) ... [2019-01-01 23:54:27,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:27,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:54:27,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:54:27,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:54:27,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (1/1) ... [2019-01-01 23:54:27,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:54:27,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:54:27,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:54:27,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:54:27,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (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:54:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:54:28,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:54:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-01 23:54:28,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-01 23:54:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-01 23:54:28,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-01 23:54:28,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:54:28,345 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:54:28,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:28 BoogieIcfgContainer [2019-01-01 23:54:28,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:54:28,346 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:54:28,347 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:54:28,350 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:54:28,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:28,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:54:27" (1/3) ... [2019-01-01 23:54:28,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed8743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:28, skipping insertion in model container [2019-01-01 23:54:28,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:28,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:27" (2/3) ... [2019-01-01 23:54:28,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed8743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:28, skipping insertion in model container [2019-01-01 23:54:28,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:28,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:28" (3/3) ... [2019-01-01 23:54:28,358 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2019-01-01 23:54:28,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:54:28,423 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:54:28,423 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:54:28,423 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:54:28,423 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:54:28,424 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:54:28,424 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:54:28,424 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:54:28,424 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:54:28,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:28,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:28,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:28,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:28,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:28,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:28,501 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:54:28,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:28,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:28,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:28,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:28,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:28,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:28,518 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-01-01 23:54:28,519 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-01-01 23:54:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-01-01 23:54:28,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:28,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-01-01 23:54:28,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-01-01 23:54:28,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:28,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:29,118 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 23:54:29,238 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:29,240 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:29,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:29,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:29,240 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:29,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:29,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:29,241 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:29,241 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:29,241 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:29,265 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:54:29,282 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:54:29,287 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:54:29,291 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:54:29,301 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:54:29,306 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:54:29,309 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:54:29,315 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:54:29,322 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:54:29,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:54:29,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:29,601 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,660 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#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:54:29,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=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) [2019-01-01 23:54:29,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,732 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,743 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=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:54:29,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,796 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,796 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:29,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,832 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,842 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,843 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:54:29,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,892 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,892 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:29,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:29,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:29,938 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:54:29,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:29,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:30,023 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:30,025 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:30,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:30,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:30,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:30,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:30,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:30,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:30,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:30,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:30,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:30,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:30,028 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:54:30,034 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:54:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:30,048 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:54:30,051 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:54:30,057 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:54:30,060 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:54:30,061 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:54:30,064 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:54:30,074 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:54:30,484 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-01 23:54:30,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:30,783 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:30,785 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:54:30,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,802 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:54:30,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:30,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,822 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:54:30,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,837 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:54:30,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,849 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:54:30,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,861 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:54:30,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,874 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:54:30,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:30,884 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:54:30,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:30,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:30,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:30,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:30,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:30,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:30,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:30,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:30,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:30,924 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:30,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:30,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:30,930 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:30,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-01-01 23:54:30,933 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:31,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:31,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:31,269 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:54:31,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 23:54:31,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-01-01 23:54:31,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2019-01-01 23:54:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-01-01 23:54:31,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 23:54:31,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:31,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 23:54:31,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:31,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 23:54:31,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:31,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-01-01 23:54:31,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:31,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-01-01 23:54:31,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 23:54:31,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-01 23:54:31,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-01-01 23:54:31,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:31,688 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-01-01 23:54:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-01-01 23:54:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-01-01 23:54:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 23:54:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-01-01 23:54:31,732 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:54:31,732 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:54:31,732 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:54:31,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-01-01 23:54:31,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:31,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:31,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:31,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:31,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:31,739 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-01-01 23:54:31,739 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-01-01 23:54:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-01-01 23:54:31,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:31,873 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:54:31,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:31,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:31,878 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-01-01 23:54:31,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:31,983 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:54:31,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:31,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:31,987 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:54:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:54:31,992 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-01-01 23:54:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:32,225 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-01-01 23:54:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:54:32,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-01-01 23:54:32,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:32,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-01-01 23:54:32,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-01 23:54:32,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 23:54:32,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-01-01 23:54:32,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:32,234 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-01-01 23:54:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-01-01 23:54:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-01 23:54:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 23:54:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-01-01 23:54:32,244 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:54:32,245 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:54:32,245 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:54:32,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-01-01 23:54:32,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:32,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:32,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:32,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:32,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:32,251 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2019-01-01 23:54:32,251 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2019-01-01 23:54:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-01-01 23:54:32,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:32,404 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:54:32,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:32,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:32,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:32,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:32,437 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:54:32,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:32,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 23:54:32,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-01-01 23:54:32,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:32,728 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:32,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:32,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:32,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:32,729 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:32,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:32,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:32,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:32,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:32,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:32,730 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:32,733 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:54:32,735 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:54:32,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:32,746 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:54:32,751 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:54:32,753 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:54:32,756 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:54:32,758 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:54:32,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:54:32,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:32,815 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:32,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:32,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:32,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:32,824 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:32,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:32,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:32,853 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:32,853 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:32,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:32,875 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:54:32,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:32,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:33,849 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:33,851 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:33,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:33,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:33,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:33,852 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:33,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:33,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:33,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:33,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:33,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:33,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:33,854 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:54:33,858 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:54:33,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:33,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:33,872 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:54:33,874 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:54:33,877 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:54:33,881 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:54:33,884 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:54:34,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:34,038 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:34,038 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:54:34,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:34,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:34,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:34,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:34,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:34,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:34,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:34,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:34,044 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:54:34,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:34,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:34,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:34,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:34,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:34,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:34,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:34,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:34,050 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:54:34,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:34,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:34,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:34,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:34,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:34,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:34,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:34,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:34,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:34,065 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:34,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:34,066 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:34,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:34,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-01 23:54:34,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:34,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:34,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:34,354 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:54:34,355 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:54:34,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-01-01 23:54:34,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2019-01-01 23:54:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:54:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-01-01 23:54:34,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-01-01 23:54:34,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:34,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-01-01 23:54:34,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:34,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-01-01 23:54:34,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:34,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-01-01 23:54:34,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:34,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-01-01 23:54:34,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-01 23:54:34,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-01 23:54:34,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-01-01 23:54:34,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:34,812 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-01-01 23:54:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-01-01 23:54:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-01-01 23:54:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-01 23:54:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-01-01 23:54:34,835 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-01-01 23:54:34,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:54:34,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:54:34,836 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2019-01-01 23:54:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:35,043 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-01-01 23:54:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:54:35,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-01-01 23:54:35,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:35,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-01-01 23:54:35,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-01 23:54:35,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-01 23:54:35,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-01-01 23:54:35,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:35,061 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-01-01 23:54:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-01-01 23:54:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-01-01 23:54:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-01 23:54:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-01-01 23:54:35,082 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:54:35,083 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:54:35,083 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:54:35,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-01-01 23:54:35,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:35,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:35,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:35,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 23:54:35,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 23:54:35,095 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:54:35,096 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:54:35,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-01-01 23:54:35,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:35,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-01-01 23:54:35,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:35,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:35,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 23 proven. 71 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-01-01 23:54:35,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:35,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2019-01-01 23:54:35,715 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-01-01 23:54:35,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:35,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:35,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:35,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-01 23:54:35,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:35,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:35,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:35,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 23:54:35,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 23:54:35,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 23:54:35,871 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:54:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:54:35,872 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-01-01 23:54:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:35,953 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-01-01 23:54:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:54:35,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-01-01 23:54:35,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:35,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-01-01 23:54:35,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-01 23:54:35,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-01 23:54:35,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-01-01 23:54:35,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:35,977 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-01-01 23:54:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-01-01 23:54:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-01-01 23:54:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 23:54:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-01-01 23:54:36,001 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:54:36,001 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:54:36,001 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:54:36,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-01-01 23:54:36,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:36,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:36,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:36,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-01 23:54:36,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:36,010 INFO L794 eck$LassoCheckResult]: Stem: 1917#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1880#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1886#fibo1ENTRY ~n := #in~n; 1923#L8 assume !(~n < 1); 1879#L10 assume !(1 == ~n); 1881#L13 call #t~ret0 := fibo2(~n - 1);< 1900#fibo2ENTRY ~n := #in~n; 1921#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1905#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume 1 == ~n;#res := 1; 1874#fibo2FINAL assume true; 1875#fibo2EXIT >#49#return; 1870#L13-1 call #t~ret1 := fibo2(~n - 2);< 1906#fibo2ENTRY ~n := #in~n; 1927#L18 assume !(~n < 1); 1925#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1948#L8 assume !(~n < 1); 1955#L10 assume 1 == ~n;#res := 1; 1956#fibo1FINAL assume true; 1949#fibo1EXIT >#45#return; 1877#L23-1 call #t~ret3 := fibo1(~n - 2);< 1885#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1942#L10 assume !(1 == ~n); 1884#L13 call #t~ret0 := fibo2(~n - 1);< 1938#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 1931#L20 assume 1 == ~n;#res := 1; 1932#fibo2FINAL assume true; 1922#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#45#return; 1977#L23-1 call #t~ret3 := fibo1(~n - 2);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#49#return; 1919#L13-1 [2019-01-01 23:54:36,010 INFO L796 eck$LassoCheckResult]: Loop: 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume !(1 == ~n); 1979#L23 call #t~ret2 := fibo1(~n - 1);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 [2019-01-01 23:54:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-01-01 23:54:36,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:36,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-01 23:54:36,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:36,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:54:36,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:54:36,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:36,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-01 23:54:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-01 23:54:36,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:36,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2019-01-01 23:54:36,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:36,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:36,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:36,810 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 23:54:36,925 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:36,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:36,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:36,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:36,926 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:36,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:36,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:36,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:36,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:36,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:36,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:36,928 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:54:36,932 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:54:36,934 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:54:36,936 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:54:36,938 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:54:36,942 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:54:36,944 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:54:36,953 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:54:36,955 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:54:37,011 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:37,012 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:37,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,035 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:37,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,060 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,088 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:37,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:37,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,113 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,116 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,116 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:37,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:37,170 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:37,170 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:37,193 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:37,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:38,627 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:38,629 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:38,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:38,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:38,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:38,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:38,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:38,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:38,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:38,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:38,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:38,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:38,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:38,669 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:54:38,682 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:54:38,688 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:54:38,689 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:54:38,692 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:54:38,693 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:54:38,698 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:54:38,701 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:54:38,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:38,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:38,758 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:54:38,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,763 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:54:38,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,766 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:54:38,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,769 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:54:38,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,772 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:54:38,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:38,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:38,778 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:54:38,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,782 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:38,785 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:38,786 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:38,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:38,786 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:38,786 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:38,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-01 23:54:38,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:39,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:39,493 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:54:39,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:54:39,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:54:40,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2019-01-01 23:54:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:54:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2019-01-01 23:54:40,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:54:40,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:40,075 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:40,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:40,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,269 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:54:41,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:54:41,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:54:41,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2019-01-01 23:54:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:54:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2019-01-01 23:54:41,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:54:41,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,808 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:42,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:42,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:42,463 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:54:42,464 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 7 loop predicates [2019-01-01 23:54:42,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:54:42,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2019-01-01 23:54:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:54:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2019-01-01 23:54:42,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:54:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2019-01-01 23:54:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2019-01-01 23:54:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:42,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2019-01-01 23:54:42,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2019-01-01 23:54:42,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2019-01-01 23:54:42,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-01-01 23:54:43,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2019-01-01 23:54:43,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2019-01-01 23:54:43,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:43,012 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2019-01-01 23:54:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2019-01-01 23:54:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2019-01-01 23:54:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-01-01 23:54:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2019-01-01 23:54:43,102 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2019-01-01 23:54:43,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 23:54:43,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-01 23:54:43,103 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2019-01-01 23:54:43,507 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 23:54:44,563 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-01 23:54:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:45,225 INFO L93 Difference]: Finished difference Result 1248 states and 1763 transitions. [2019-01-01 23:54:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 23:54:45,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1763 transitions. [2019-01-01 23:54:45,242 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2019-01-01 23:54:45,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 608 states and 744 transitions. [2019-01-01 23:54:45,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2019-01-01 23:54:45,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-01-01 23:54:45,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 744 transitions. [2019-01-01 23:54:45,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:45,252 INFO L705 BuchiCegarLoop]: Abstraction has 608 states and 744 transitions. [2019-01-01 23:54:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 744 transitions. [2019-01-01 23:54:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2019-01-01 23:54:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-01 23:54:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 726 transitions. [2019-01-01 23:54:45,276 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2019-01-01 23:54:45,276 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2019-01-01 23:54:45,276 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:54:45,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 726 transitions. [2019-01-01 23:54:45,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2019-01-01 23:54:45,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:45,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:45,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:45,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:45,287 INFO L794 eck$LassoCheckResult]: Stem: 8925#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 8891#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8892#fibo1ENTRY ~n := #in~n; 9055#L8 assume !(~n < 1); 9054#L10 assume !(1 == ~n); 9051#L13 call #t~ret0 := fibo2(~n - 1);< 9053#fibo2ENTRY ~n := #in~n; 9052#L18 assume !(~n < 1); 9050#L20 assume !(1 == ~n); 9036#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9043#L8 assume !(~n < 1); 9041#L10 assume !(1 == ~n); 9009#L13 call #t~ret0 := fibo2(~n - 1);< 9039#fibo2ENTRY ~n := #in~n; 9044#L18 assume !(~n < 1); 9042#L20 assume !(1 == ~n); 9035#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9046#L8 assume !(~n < 1); 9144#L10 assume 1 == ~n;#res := 1; 9145#fibo1FINAL assume true; 9138#fibo1EXIT >#45#return; 8994#L23-1 call #t~ret3 := fibo1(~n - 2);< 9119#fibo1ENTRY ~n := #in~n; 9131#L8 assume ~n < 1;#res := 0; 9128#fibo1FINAL assume true; 9118#fibo1EXIT >#47#return; 9107#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9104#fibo2FINAL assume true; 9095#fibo2EXIT >#49#return; 9080#L13-1 [2019-01-01 23:54:45,287 INFO L796 eck$LassoCheckResult]: Loop: 9080#L13-1 call #t~ret1 := fibo2(~n - 2);< 9084#fibo2ENTRY ~n := #in~n; 9085#L18 assume !(~n < 1); 9078#L20 assume !(1 == ~n); 9063#L23 call #t~ret2 := fibo1(~n - 1);< 9156#fibo1ENTRY ~n := #in~n; 9071#L8 assume !(~n < 1); 9072#L10 assume !(1 == ~n); 8881#L13 call #t~ret0 := fibo2(~n - 1);< 9314#fibo2ENTRY ~n := #in~n; 9394#L18 assume !(~n < 1); 9342#L20 assume 1 == ~n;#res := 1; 9340#fibo2FINAL assume true; 9312#fibo2EXIT >#49#return; 9310#L13-1 call #t~ret1 := fibo2(~n - 2);< 9311#fibo2ENTRY ~n := #in~n; 9333#L18 assume ~n < 1;#res := 0; 9332#fibo2FINAL assume true; 9309#fibo2EXIT >#51#return; 9308#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9307#fibo1FINAL assume true; 9303#fibo1EXIT >#45#return; 9114#L23-1 call #t~ret3 := fibo1(~n - 2);< 9117#fibo1ENTRY ~n := #in~n; 9167#L8 assume !(~n < 1); 9163#L10 assume !(1 == ~n); 9157#L13 call #t~ret0 := fibo2(~n - 1);< 9161#fibo2ENTRY ~n := #in~n; 9160#L18 assume !(~n < 1); 9158#L20 assume 1 == ~n;#res := 1; 9159#fibo2FINAL assume true; 9185#fibo2EXIT >#49#return; 9080#L13-1 [2019-01-01 23:54:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2019-01-01 23:54:45,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:45,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:45,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2019-01-01 23:54:45,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:45,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 23:54:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:45,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:45,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:54:45,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:45,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 23:54:45,460 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:54:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:54:45,460 INFO L87 Difference]: Start difference. First operand 590 states and 726 transitions. cyclomatic complexity: 145 Second operand 10 states. [2019-01-01 23:54:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:45,648 INFO L93 Difference]: Finished difference Result 377 states and 480 transitions. [2019-01-01 23:54:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:54:45,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 480 transitions. [2019-01-01 23:54:45,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-01 23:54:45,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 276 states and 335 transitions. [2019-01-01 23:54:45,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2019-01-01 23:54:45,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2019-01-01 23:54:45,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 335 transitions. [2019-01-01 23:54:45,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:45,658 INFO L705 BuchiCegarLoop]: Abstraction has 276 states and 335 transitions. [2019-01-01 23:54:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 335 transitions. [2019-01-01 23:54:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2019-01-01 23:54:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-01 23:54:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 324 transitions. [2019-01-01 23:54:45,668 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2019-01-01 23:54:45,668 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2019-01-01 23:54:45,669 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:54:45,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 324 transitions. [2019-01-01 23:54:45,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-01 23:54:45,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:45,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:45,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:45,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:45,675 INFO L794 eck$LassoCheckResult]: Stem: 9999#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 9972#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9973#fibo1ENTRY ~n := #in~n; 10078#L8 assume !(~n < 1); 10077#L10 assume !(1 == ~n); 10074#L13 call #t~ret0 := fibo2(~n - 1);< 10076#fibo2ENTRY ~n := #in~n; 10075#L18 assume !(~n < 1); 10073#L20 assume !(1 == ~n); 10051#L23 call #t~ret2 := fibo1(~n - 1);< 10062#fibo1ENTRY ~n := #in~n; 10060#L8 assume !(~n < 1); 10058#L10 assume !(1 == ~n); 10055#L13 call #t~ret0 := fibo2(~n - 1);< 10056#fibo2ENTRY ~n := #in~n; 10061#L18 assume !(~n < 1); 10059#L20 assume 1 == ~n;#res := 1; 10057#fibo2FINAL assume true; 10054#fibo2EXIT >#49#return; 10039#L13-1 call #t~ret1 := fibo2(~n - 2);< 10049#fibo2ENTRY ~n := #in~n; 10047#L18 assume !(~n < 1); 10045#L20 assume !(1 == ~n); 10028#L23 call #t~ret2 := fibo1(~n - 1);< 10037#fibo1ENTRY ~n := #in~n; 10035#L8 assume !(~n < 1); 10030#L10 assume !(1 == ~n); 10011#L13 call #t~ret0 := fibo2(~n - 1);< 10026#fibo2ENTRY ~n := #in~n; 10022#L18 assume !(~n < 1); 10016#L20 assume !(1 == ~n); 10008#L23 call #t~ret2 := fibo1(~n - 1);< 10012#fibo1ENTRY ~n := #in~n; 10024#L8 assume !(~n < 1); 10020#L10 assume 1 == ~n;#res := 1; 10014#fibo1FINAL assume true; 10007#fibo1EXIT >#45#return; 10009#L23-1 call #t~ret3 := fibo1(~n - 2);< 10071#fibo1ENTRY ~n := #in~n; 10064#L8 assume ~n < 1;#res := 0; 10065#fibo1FINAL assume true; 10070#fibo1EXIT >#47#return; 10069#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10068#fibo2FINAL assume true; 10066#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2019-01-01 23:54:45,675 INFO L796 eck$LassoCheckResult]: Loop: 10029#L23 call #t~ret2 := fibo1(~n - 1);< 10038#fibo1ENTRY ~n := #in~n; 10036#L8 assume !(~n < 1); 10032#L10 assume !(1 == ~n); 9970#L13 call #t~ret0 := fibo2(~n - 1);< 10027#fibo2ENTRY ~n := #in~n; 10023#L18 assume !(~n < 1); 10018#L20 assume !(1 == ~n); 9982#L23 call #t~ret2 := fibo1(~n - 1);< 10013#fibo1ENTRY ~n := #in~n; 10025#L8 assume !(~n < 1); 10021#L10 assume 1 == ~n;#res := 1; 10015#fibo1FINAL assume true; 10010#fibo1EXIT >#45#return; 9969#L23-1 call #t~ret3 := fibo1(~n - 2);< 9971#fibo1ENTRY ~n := #in~n; 10072#L8 assume ~n < 1;#res := 0; 9993#fibo1FINAL assume true; 9981#fibo1EXIT >#47#return; 9976#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9977#fibo2FINAL assume true; 10124#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2019-01-01 23:54:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -582096202, now seen corresponding path program 1 times [2019-01-01 23:54:45,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:45,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:45,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:45,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 23:54:45,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:45,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-01 23:54:46,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-01-01 23:54:46,195 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 1 times [2019-01-01 23:54:46,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:54:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:46,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:46,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:54:46,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:46,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 23:54:46,351 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:54:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:54:46,352 INFO L87 Difference]: Start difference. First operand 270 states and 324 transitions. cyclomatic complexity: 59 Second operand 10 states. [2019-01-01 23:54:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:46,648 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2019-01-01 23:54:46,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:54:46,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 190 transitions. [2019-01-01 23:54:46,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-01 23:54:46,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 128 states and 145 transitions. [2019-01-01 23:54:46,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2019-01-01 23:54:46,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-01-01 23:54:46,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2019-01-01 23:54:46,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:46,656 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 145 transitions. [2019-01-01 23:54:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2019-01-01 23:54:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2019-01-01 23:54:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 23:54:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2019-01-01 23:54:46,662 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-01-01 23:54:46,662 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-01-01 23:54:46,662 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:54:46,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 138 transitions. [2019-01-01 23:54:46,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-01 23:54:46,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:46,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:46,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:46,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:46,670 INFO L794 eck$LassoCheckResult]: Stem: 10683#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 10661#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10663#fibo1ENTRY ~n := #in~n; 10696#L8 assume !(~n < 1); 10660#L10 assume !(1 == ~n); 10662#L13 call #t~ret0 := fibo2(~n - 1);< 10674#fibo2ENTRY ~n := #in~n; 10688#L18 assume !(~n < 1); 10692#L20 assume !(1 == ~n); 10658#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10682#L8 assume !(~n < 1); 10657#L10 assume 1 == ~n;#res := 1; 10659#fibo1FINAL assume true; 10737#fibo1EXIT >#45#return; 10735#L23-1 call #t~ret3 := fibo1(~n - 2);< 10736#fibo1ENTRY ~n := #in~n; 10742#L8 assume ~n < 1;#res := 0; 10741#fibo1FINAL assume true; 10734#fibo1EXIT >#47#return; 10727#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10723#fibo2FINAL assume true; 10718#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2019-01-01 23:54:46,670 INFO L796 eck$LassoCheckResult]: Loop: 10668#L23-1 call #t~ret3 := fibo1(~n - 2);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume 1 == ~n;#res := 1; 10717#fibo1FINAL assume true; 10761#fibo1EXIT >#45#return; 10652#L23-1 call #t~ret3 := fibo1(~n - 2);< 10653#fibo1ENTRY ~n := #in~n; 10680#L8 assume ~n < 1;#res := 0; 10675#fibo1FINAL assume true; 10666#fibo1EXIT >#47#return; 10664#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10665#fibo2FINAL assume true; 10719#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2019-01-01 23:54:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash -444366370, now seen corresponding path program 1 times [2019-01-01 23:54:46,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:46,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 23:54:47,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:47,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:47,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 23:54:47,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:47,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-01 23:54:47,739 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1179096830, now seen corresponding path program 1 times [2019-01-01 23:54:47,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:47,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:47,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 23:54:47,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:47,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:47,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:47,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 23:54:47,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:47,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-01 23:54:47,948 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 23:54:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 23:54:47,948 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. cyclomatic complexity: 19 Second operand 11 states. [2019-01-01 23:54:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:48,091 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-01-01 23:54:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:54:48,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2019-01-01 23:54:48,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-01 23:54:48,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 127 states and 141 transitions. [2019-01-01 23:54:48,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2019-01-01 23:54:48,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2019-01-01 23:54:48,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 141 transitions. [2019-01-01 23:54:48,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:48,097 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 141 transitions. [2019-01-01 23:54:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 141 transitions. [2019-01-01 23:54:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-01-01 23:54:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-01 23:54:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2019-01-01 23:54:48,105 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-01-01 23:54:48,105 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-01-01 23:54:48,105 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:54:48,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 138 transitions. [2019-01-01 23:54:48,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-01 23:54:48,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:48,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:48,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:48,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:48,115 INFO L794 eck$LassoCheckResult]: Stem: 11219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 11193#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11194#fibo1ENTRY ~n := #in~n; 11230#L8 assume !(~n < 1); 11198#L10 assume !(1 == ~n); 11199#L13 call #t~ret0 := fibo2(~n - 1);< 11211#fibo2ENTRY ~n := #in~n; 11225#L18 assume !(~n < 1); 11233#L20 assume !(1 == ~n); 11196#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11223#L8 assume !(~n < 1); 11195#L10 assume 1 == ~n;#res := 1; 11197#fibo1FINAL assume true; 11206#fibo1EXIT >#45#return; 11207#L23-1 call #t~ret3 := fibo1(~n - 2);< 11278#fibo1ENTRY ~n := #in~n; 11296#L8 assume ~n < 1;#res := 0; 11294#fibo1FINAL assume true; 11277#fibo1EXIT >#47#return; 11275#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11273#fibo2FINAL assume true; 11253#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2019-01-01 23:54:48,115 INFO L796 eck$LassoCheckResult]: Loop: 11214#L23-1 call #t~ret3 := fibo1(~n - 2);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume 1 == ~n;#res := 1; 11265#fibo1FINAL assume true; 11264#fibo1EXIT >#45#return; 11262#L23-1 call #t~ret3 := fibo1(~n - 2);< 11263#fibo1ENTRY ~n := #in~n; 11269#L8 assume ~n < 1;#res := 0; 11266#fibo1FINAL assume true; 11261#fibo1EXIT >#47#return; 11260#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11259#fibo2FINAL assume true; 11252#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2019-01-01 23:54:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -167011978, now seen corresponding path program 1 times [2019-01-01 23:54:48,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:48,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 23:54:48,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:48,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:48,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:48,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 23:54:48,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:48,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-01 23:54:48,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1468819758, now seen corresponding path program 1 times [2019-01-01 23:54:48,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:48,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:49,453 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:49,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:49,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:49,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:49,453 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:49,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:49,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:49,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-01 23:54:49,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:49,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:49,456 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:54:49,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:49,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:49,475 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:54:49,478 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:54:49,480 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:54:49,484 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:54:49,487 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:54:49,492 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:54:49,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:49,595 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:49,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=2} Honda state: {fibo2_#t~ret2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,626 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:49,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:50,376 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:50,378 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:50,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:50,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:50,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:50,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:50,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:50,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:50,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:50,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-01 23:54:50,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:50,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:50,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:50,393 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:54:50,396 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:54:50,399 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:54:50,400 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:54:50,401 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:54:50,403 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:54:50,405 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:54:50,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:54:50,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:50,485 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:50,486 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:54:50,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:50,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:50,499 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:50,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:50,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:50,499 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:50,500 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-01 23:54:50,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:50,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:50,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 23:54:50,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-01 23:54:50,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-01 23:54:50,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2019-01-01 23:54:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 23:54:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-01 23:54:50,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-01 23:54:50,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:50,960 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 23:54:51,259 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-01 23:54:51,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-01 23:54:51,531 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-01 23:54:51,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2019-01-01 23:54:51,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 23:54:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-01 23:54:51,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-01 23:54:51,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:51,634 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 23:54:51,962 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 10 loop predicates [2019-01-01 23:54:51,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-01 23:54:52,916 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 777 states and 862 transitions. Complement of second has 114 states. [2019-01-01 23:54:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 23:54:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2019-01-01 23:54:52,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-01 23:54:52,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:52,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 87 letters. Loop has 39 letters. [2019-01-01 23:54:52,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:52,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 78 letters. [2019-01-01 23:54:52,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:52,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 862 transitions. [2019-01-01 23:54:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2019-01-01 23:54:52,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 292 states and 307 transitions. [2019-01-01 23:54:52,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-01 23:54:52,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-01-01 23:54:52,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 307 transitions. [2019-01-01 23:54:52,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:52,942 INFO L705 BuchiCegarLoop]: Abstraction has 292 states and 307 transitions. [2019-01-01 23:54:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 307 transitions. [2019-01-01 23:54:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2019-01-01 23:54:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-01 23:54:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2019-01-01 23:54:52,954 INFO L728 BuchiCegarLoop]: Abstraction has 242 states and 256 transitions. [2019-01-01 23:54:52,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 23:54:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-01 23:54:52,958 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand 17 states. [2019-01-01 23:54:53,376 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 23:54:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:53,947 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2019-01-01 23:54:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 23:54:53,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 193 transitions. [2019-01-01 23:54:53,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:54:53,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 122 states and 129 transitions. [2019-01-01 23:54:53,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-01-01 23:54:53,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2019-01-01 23:54:53,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 129 transitions. [2019-01-01 23:54:53,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:53,955 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-01-01 23:54:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 129 transitions. [2019-01-01 23:54:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-01 23:54:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-01 23:54:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-01-01 23:54:53,962 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-01-01 23:54:53,963 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-01-01 23:54:53,965 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:54:53,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 128 transitions. [2019-01-01 23:54:53,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:54:53,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:53,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:53,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:53,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:53,971 INFO L794 eck$LassoCheckResult]: Stem: 13975#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13952#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13956#fibo1ENTRY ~n := #in~n; 13984#L8 assume !(~n < 1); 13951#L10 assume !(1 == ~n); 13953#L13 call #t~ret0 := fibo2(~n - 1);< 13994#fibo2ENTRY ~n := #in~n; 13982#L18 assume !(~n < 1); 13983#L20 assume !(1 == ~n); 13964#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13973#L8 assume !(~n < 1); 13979#L10 assume !(1 == ~n); 13946#L13 call #t~ret0 := fibo2(~n - 1);< 13965#fibo2ENTRY ~n := #in~n; 13977#L18 assume !(~n < 1); 13981#L20 assume !(1 == ~n); 13945#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13974#L8 assume !(~n < 1); 14047#L10 assume 1 == ~n;#res := 1; 14046#fibo1FINAL assume true; 14045#fibo1EXIT >#45#return; 13948#L23-1 call #t~ret3 := fibo1(~n - 2);< 13949#fibo1ENTRY ~n := #in~n; 14051#L8 assume ~n < 1;#res := 0; 14049#fibo1FINAL assume true; 14048#fibo1EXIT >#47#return; 13957#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13954#fibo2FINAL assume true; 13955#fibo2EXIT >#49#return; 13978#L13-1 call #t~ret1 := fibo2(~n - 2);< 13989#fibo2ENTRY ~n := #in~n; 14022#L18 assume !(~n < 1); 14023#L20 assume 1 == ~n;#res := 1; 13990#fibo2FINAL assume true; 13992#fibo2EXIT >#51#return; 14004#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14002#fibo1FINAL assume true; 13999#fibo1EXIT >#45#return; 13987#L23-1 call #t~ret3 := fibo1(~n - 2);< 13998#fibo1ENTRY ~n := #in~n; 14015#L8 assume !(~n < 1); 14014#L10 assume !(1 == ~n); 14012#L13 call #t~ret0 := fibo2(~n - 1);< 14013#fibo2ENTRY ~n := #in~n; 14026#L18 assume !(~n < 1); 14025#L20 assume !(1 == ~n); 13963#L23 call #t~ret2 := fibo1(~n - 1);< 14039#fibo1ENTRY ~n := #in~n; 14044#L8 assume !(~n < 1); 14043#L10 assume !(1 == ~n); 13943#L13 [2019-01-01 23:54:53,971 INFO L796 eck$LassoCheckResult]: Loop: 13943#L13 call #t~ret0 := fibo2(~n - 1);< 13962#fibo2ENTRY ~n := #in~n; 13976#L18 assume !(~n < 1); 13980#L20 assume !(1 == ~n); 13942#L23 call #t~ret2 := fibo1(~n - 1);< 13944#fibo1ENTRY ~n := #in~n; 13972#L8 assume !(~n < 1); 13950#L10 assume !(1 == ~n); 13943#L13 [2019-01-01 23:54:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1751159525, now seen corresponding path program 2 times [2019-01-01 23:54:53,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:53,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:53,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:53,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 23:54:54,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:54,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:54,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:54:54,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:54:54,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:54,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 23:54:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:54,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-01-01 23:54:54,202 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 2 times [2019-01-01 23:54:54,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:54,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:54,391 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:54,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:54,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:54,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:54,392 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:54,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:54,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:54,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:54,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2019-01-01 23:54:54,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:54,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:54,408 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:54:54,411 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:54:54,412 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:54:54,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:54,415 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:54:54,416 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:54:54,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:54:54,419 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:54:54,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:54,469 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:54,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:54,478 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:54,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:54,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,285 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:56,287 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:56,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:56,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:56,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:56,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:56,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:56,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:56,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:56,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2019-01-01 23:54:56,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:56,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:56,289 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:54:56,302 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:54:56,306 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:54:56,311 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:54:56,312 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:54:56,313 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:54:56,315 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:54:56,316 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:54:56,318 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:54:56,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:56,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:56,368 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:54:56,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:56,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:56,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:56,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:56,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:56,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:56,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:56,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:56,384 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:56,388 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:56,389 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:56,389 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:56,389 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:56,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-01 23:54:56,390 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:56,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:56,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:56,743 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:54:56,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-01-01 23:54:56,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-01 23:54:56,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 135 states and 143 transitions. Complement of second has 19 states. [2019-01-01 23:54:56,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 23:54:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-01 23:54:56,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-01 23:54:56,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:56,873 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:57,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,225 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:54:57,225 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-01-01 23:54:57,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-01 23:54:57,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 141 states and 149 transitions. Complement of second has 21 states. [2019-01-01 23:54:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 23:54:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2019-01-01 23:54:57,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-01 23:54:57,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:57,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:57,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,663 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:54:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:57,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,831 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:54:57,832 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 6 loop predicates [2019-01-01 23:54:57,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-01 23:54:58,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 192 states and 201 transitions. Complement of second has 30 states. [2019-01-01 23:54:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 23:54:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2019-01-01 23:54:58,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-01 23:54:58,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:58,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 60 letters. Loop has 8 letters. [2019-01-01 23:54:58,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:58,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 16 letters. [2019-01-01 23:54:58,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:58,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 201 transitions. [2019-01-01 23:54:58,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:58,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2019-01-01 23:54:58,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:58,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:58,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:58,074 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,074 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 23:54:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-01 23:54:58,074 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 14 states. [2019-01-01 23:54:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:58,078 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:54:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:54:58,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,079 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:58,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:54:58,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:58,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:58,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:58,080 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,080 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,080 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,080 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:54:58,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,080 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:58,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:54:58,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:58 BoogieIcfgContainer [2019-01-01 23:54:58,091 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:58,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:58,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:58,092 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:58,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:28" (3/4) ... [2019-01-01 23:54:58,097 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:54:58,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:58,098 INFO L168 Benchmark]: Toolchain (without parser) took 30496.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 951.4 MB in the beginning and 936.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 354.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,099 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.95 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.81 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,102 INFO L168 Benchmark]: Boogie Preprocessor took 17.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,103 INFO L168 Benchmark]: RCFGBuilder took 455.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,103 INFO L168 Benchmark]: BuchiAutomizer took 29744.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 936.4 MB in the end (delta: 180.0 MB). Peak memory consumption was 379.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,104 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 936.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,112 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.95 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.81 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 455.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29744.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 936.4 MB in the end (delta: 180.0 MB). Peak memory consumption was 379.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 936.4 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 14 terminating modules (9 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.6s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 15.0s. Construction of modules took 4.6s. Büchi inclusion checks took 9.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 290 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 590 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 11/41 HoareTripleCheckerStatistics: 390 SDtfs, 786 SDslu, 839 SDs, 0 SdLazy, 2005 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf98 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf92 smp81 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...