./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 91b1670e 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-91b1670 [2018-11-29 00:02:39,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:02:39,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:02:39,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:02:39,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:02:39,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:02:39,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:02:39,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:02:39,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:02:39,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:02:39,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:02:39,548 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:02:39,549 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:02:39,550 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:02:39,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:02:39,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:02:39,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:02:39,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:02:39,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:02:39,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:02:39,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:02:39,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:02:39,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:02:39,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:02:39,567 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:02:39,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:02:39,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:02:39,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:02:39,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:02:39,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:02:39,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:02:39,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:02:39,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:02:39,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:02:39,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:02:39,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:02:39,585 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:02:39,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:02:39,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:02:39,624 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:02:39,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:02:39,625 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:02:39,626 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:02:39,626 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:02:39,626 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:02:39,626 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:02:39,626 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:02:39,626 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:02:39,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:02:39,627 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:02:39,627 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:02:39,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:02:39,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:02:39,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:02:39,629 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:02:39,630 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:02:39,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:02:39,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:02:39,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:02:39,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:02:39,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:02:39,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:02:39,631 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:02:39,632 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:02:39,633 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 [2018-11-29 00:02:39,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:02:39,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:02:39,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:02:39,713 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:02:39,714 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:02:39,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-29 00:02:39,803 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c75ba8af/e55f36de8268482ab4932ffdc1ed2f28/FLAG3b1f8f34f [2018-11-29 00:02:40,320 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:02:40,321 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-29 00:02:40,329 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c75ba8af/e55f36de8268482ab4932ffdc1ed2f28/FLAG3b1f8f34f [2018-11-29 00:02:40,674 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c75ba8af/e55f36de8268482ab4932ffdc1ed2f28 [2018-11-29 00:02:40,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:02:40,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:02:40,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:40,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:02:40,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:02:40,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:40" (1/1) ... [2018-11-29 00:02:40,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532af33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:40, skipping insertion in model container [2018-11-29 00:02:40,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:40" (1/1) ... [2018-11-29 00:02:40,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:02:40,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:02:40,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:40,991 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:02:41,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:41,040 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:02:41,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41 WrapperNode [2018-11-29 00:02:41,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:41,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:41,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:02:41,042 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:02:41,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:41,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:02:41,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:02:41,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:02:41,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (1/1) ... [2018-11-29 00:02:41,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:02:41,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:02:41,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:02:41,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:02:41,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (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 [2018-11-29 00:02:41,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:02:41,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:02:41,287 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-29 00:02:41,287 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-29 00:02:41,287 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-29 00:02:41,287 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-29 00:02:41,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:02:41,557 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:02:41,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:41 BoogieIcfgContainer [2018-11-29 00:02:41,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:02:41,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:02:41,558 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:02:41,562 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:02:41,563 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:41,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:40" (1/3) ... [2018-11-29 00:02:41,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21205d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:41, skipping insertion in model container [2018-11-29 00:02:41,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:41,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:41" (2/3) ... [2018-11-29 00:02:41,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21205d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:41, skipping insertion in model container [2018-11-29 00:02:41,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:41,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:41" (3/3) ... [2018-11-29 00:02:41,568 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-29 00:02:41,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:02:41,642 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:02:41,645 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:02:41,645 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:02:41,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:02:41,650 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:02:41,650 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:02:41,651 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:02:41,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:02:41,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:02:41,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:41,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:41,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:41,757 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:41,757 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:41,757 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:02:41,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:02:41,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:41,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:41,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:41,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:41,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:41,786 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 [2018-11-29 00:02:41,788 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 [2018-11-29 00:02:41,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-11-29 00:02:41,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-11-29 00:02:41,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-11-29 00:02:41,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:42,533 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-29 00:02:42,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:42,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:42,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:42,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:42,574 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:42,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:42,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:42,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:42,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:42,575 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:42,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,942 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:42,943 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) [2018-11-29 00:02:42,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,954 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:42,968 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 [2018-11-29 00:02:42,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,001 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 [2018-11-29 00:02:43,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,046 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,047 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,088 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,108 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) [2018-11-29 00:02:43,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,152 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,166 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) [2018-11-29 00:02:43,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,202 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 [2018-11-29 00:02:43,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,217 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 [2018-11-29 00:02:43,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,249 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 [2018-11-29 00:02:43,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,280 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 [2018-11-29 00:02:43,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,308 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 [2018-11-29 00:02:43,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,333 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 [2018-11-29 00:02:43,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:43,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,414 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:43,416 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:43,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:43,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:43,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:43,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:43,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:43,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:43,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:43,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:43,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:43,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:43,882 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:43,885 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 [2018-11-29 00:02:43,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,899 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 [2018-11-29 00:02:43,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,906 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 [2018-11-29 00:02:43,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,914 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 [2018-11-29 00:02:43,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:43,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:43,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,936 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 [2018-11-29 00:02:43,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,944 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 [2018-11-29 00:02:43,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,952 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 [2018-11-29 00:02:43,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:43,971 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:43,971 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:43,974 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:43,974 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:43,975 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:43,975 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-29 00:02:43,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:44,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:44,747 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 [2018-11-29 00:02:44,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-11-29 00:02:45,195 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. [2018-11-29 00:02:45,197 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 [2018-11-29 00:02:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-29 00:02:45,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:02:45,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:45,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-29 00:02:45,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:45,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-29 00:02:45,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:45,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-11-29 00:02:45,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:45,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-11-29 00:02:45,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-29 00:02:45,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-29 00:02:45,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-11-29 00:02:45,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:45,240 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-11-29 00:02:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-11-29 00:02:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-29 00:02:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-29 00:02:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-11-29 00:02:45,279 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:02:45,279 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:02:45,280 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:02:45,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-11-29 00:02:45,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:45,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:45,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:45,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:45,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:45,286 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 [2018-11-29 00:02:45,286 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 [2018-11-29 00:02:45,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-11-29 00:02:45,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:45,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:02:45,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:45,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:45,432 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:45,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-11-29 00:02:45,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:02:45,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:45,565 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:02:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:02:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:02:45,571 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-29 00:02:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:45,817 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-29 00:02:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:02:45,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-11-29 00:02:45,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:45,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-11-29 00:02:45,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-29 00:02:45,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-29 00:02:45,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-11-29 00:02:45,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:45,829 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-11-29 00:02:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-11-29 00:02:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-29 00:02:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-29 00:02:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-29 00:02:45,840 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:02:45,840 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:02:45,840 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:02:45,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-11-29 00:02:45,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:02:45,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:45,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:45,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:45,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:45,846 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 [2018-11-29 00:02:45,847 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 [2018-11-29 00:02:45,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-11-29 00:02:45,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:45,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:46,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:46,007 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 [2018-11-29 00:02:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:46,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:46,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:46,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-29 00:02:46,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:46,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-11-29 00:02:46,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:46,340 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:46,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:46,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:46,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:46,341 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:46,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:46,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:46,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:46,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:46,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:46,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:46,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:46,445 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 [2018-11-29 00:02:46,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:46,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:46,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:46,454 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 [2018-11-29 00:02:46,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:46,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:46,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:46,484 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 [2018-11-29 00:02:46,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:46,511 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 [2018-11-29 00:02:46,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:46,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:47,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:47,558 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:47,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:47,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:47,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:47,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:47,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:47,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:47,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:47,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:47,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:47,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:47,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,742 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:47,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:47,742 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 [2018-11-29 00:02:47,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:47,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:47,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:47,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:47,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:47,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:47,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:47,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:47,749 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 [2018-11-29 00:02:47,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:47,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:47,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:47,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:47,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:47,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:47,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:47,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:47,762 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 [2018-11-29 00:02:47,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:47,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:47,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:47,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:47,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:47,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:47,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:47,774 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:47,780 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:47,781 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:47,781 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:47,783 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:47,783 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:47,783 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-29 00:02:47,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:47,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:47,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:47,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:48,115 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 [2018-11-29 00:02:48,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-29 00:02:48,631 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. [2018-11-29 00:02:48,634 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 [2018-11-29 00:02:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-29 00:02:48,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-29 00:02:48,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:48,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-11-29 00:02:48,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:48,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-11-29 00:02:48,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:48,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-11-29 00:02:48,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:48,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-11-29 00:02:48,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-29 00:02:48,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:02:48,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-11-29 00:02:48,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:48,659 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-11-29 00:02:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-11-29 00:02:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-11-29 00:02:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-29 00:02:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-11-29 00:02:48,686 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-11-29 00:02:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:02:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:02:48,687 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-11-29 00:02:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:48,914 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-11-29 00:02:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:02:48,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-11-29 00:02:48,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:48,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-11-29 00:02:48,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:02:48,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:02:48,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-11-29 00:02:48,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:48,930 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-11-29 00:02:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-11-29 00:02:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-11-29 00:02:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-29 00:02:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-11-29 00:02:48,949 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:02:48,949 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:02:48,949 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:48,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-11-29 00:02:48,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:48,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:48,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:48,960 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] [2018-11-29 00:02:48,960 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] [2018-11-29 00:02:48,961 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 [2018-11-29 00:02:48,961 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 [2018-11-29 00:02:48,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-11-29 00:02:48,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:48,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:48,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-29 00:02:49,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:49,120 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 [2018-11-29 00:02:49,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:49,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 23 proven. 71 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-29 00:02:49,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2018-11-29 00:02:49,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:49,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-11-29 00:02:49,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:49,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:49,643 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2018-11-29 00:02:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-29 00:02:49,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:49,720 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 [2018-11-29 00:02:49,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:49,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:02:49,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:02:49,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-29 00:02:49,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:02:49,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:02:49,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:02:49,810 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-29 00:02:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:49,920 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-11-29 00:02:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:02:49,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-11-29 00:02:49,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:49,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-11-29 00:02:49,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-29 00:02:49,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-29 00:02:49,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-11-29 00:02:49,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:49,938 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-11-29 00:02:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-11-29 00:02:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-11-29 00:02:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-29 00:02:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-29 00:02:49,955 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:02:49,955 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:02:49,955 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:49,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-11-29 00:02:49,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:49,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:49,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:49,964 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] [2018-11-29 00:02:49,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:49,964 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 [2018-11-29 00:02:49,964 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 [2018-11-29 00:02:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-11-29 00:02:49,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-29 00:02:50,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:50,445 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 [2018-11-29 00:02:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:02:50,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:02:50,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:50,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-29 00:02:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-29 00:02:50,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:50,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-11-29 00:02:50,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:50,943 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-29 00:02:51,061 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:51,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:51,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:51,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:51,062 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:51,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:51,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:51,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:51,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:51,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:51,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:51,155 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 [2018-11-29 00:02:51,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,175 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,201 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 [2018-11-29 00:02:51,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,228 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,254 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,254 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 [2018-11-29 00:02:51,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,277 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,280 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 [2018-11-29 00:02:51,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,307 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 [2018-11-29 00:02:51,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,330 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 [2018-11-29 00:02:51,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:51,356 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:52,865 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:52,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:52,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:52,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:52,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:52,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:52,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:52,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:52,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:52,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:52,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:52,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:52,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:52,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:53,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:53,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:53,033 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 [2018-11-29 00:02:53,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,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 [2018-11-29 00:02:53,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,041 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 [2018-11-29 00:02:53,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,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 [2018-11-29 00:02:53,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,047 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 [2018-11-29 00:02:53,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,049 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 [2018-11-29 00:02:53,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:53,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:53,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:53,073 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:53,073 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:53,073 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:53,074 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:53,074 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:53,074 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-29 00:02:53,074 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:53,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:53,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:53,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:53,799 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 [2018-11-29 00:02:53,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:02:54,408 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. [2018-11-29 00:02:54,414 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 [2018-11-29 00:02:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-29 00:02:54,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:02:54,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:54,417 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:54,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:55,073 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 [2018-11-29 00:02:55,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:02:55,597 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. [2018-11-29 00:02:55,602 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 [2018-11-29 00:02:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-29 00:02:55,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:02:55,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:55,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:55,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:56,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:56,241 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 [2018-11-29 00:02:56,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:02:56,730 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. [2018-11-29 00:02:56,734 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 [2018-11-29 00:02:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-29 00:02:56,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:02:56,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-11-29 00:02:56,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-11-29 00:02:56,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-11-29 00:02:56,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-29 00:02:56,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-11-29 00:02:56,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-11-29 00:02:56,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-11-29 00:02:56,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-11-29 00:02:56,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:56,805 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-11-29 00:02:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-11-29 00:02:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-11-29 00:02:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-29 00:02:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-11-29 00:02:56,916 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-11-29 00:02:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:02:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:02:56,918 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2018-11-29 00:02:57,391 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:02:58,589 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-29 00:02:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:58,842 INFO L93 Difference]: Finished difference Result 1248 states and 1763 transitions. [2018-11-29 00:02:58,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:02:58,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1763 transitions. [2018-11-29 00:02:58,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2018-11-29 00:02:58,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 608 states and 744 transitions. [2018-11-29 00:02:58,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2018-11-29 00:02:58,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2018-11-29 00:02:58,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 744 transitions. [2018-11-29 00:02:58,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:58,878 INFO L705 BuchiCegarLoop]: Abstraction has 608 states and 744 transitions. [2018-11-29 00:02:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 744 transitions. [2018-11-29 00:02:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2018-11-29 00:02:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-29 00:02:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 726 transitions. [2018-11-29 00:02:58,900 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2018-11-29 00:02:58,901 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2018-11-29 00:02:58,901 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:02:58,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 726 transitions. [2018-11-29 00:02:58,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-29 00:02:58,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:58,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:58,911 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] [2018-11-29 00:02:58,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:58,915 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 [2018-11-29 00:02:58,915 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 [2018-11-29 00:02:58,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2018-11-29 00:02:58,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:58,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2018-11-29 00:02:58,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:58,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-29 00:02:59,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:59,083 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 [2018-11-29 00:02:59,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:02:59,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:59,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-29 00:02:59,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:02:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:02:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:02:59,137 INFO L87 Difference]: Start difference. First operand 590 states and 726 transitions. cyclomatic complexity: 145 Second operand 10 states. [2018-11-29 00:02:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:59,336 INFO L93 Difference]: Finished difference Result 377 states and 480 transitions. [2018-11-29 00:02:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:02:59,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 480 transitions. [2018-11-29 00:02:59,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-29 00:02:59,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 276 states and 335 transitions. [2018-11-29 00:02:59,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-29 00:02:59,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2018-11-29 00:02:59,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 335 transitions. [2018-11-29 00:02:59,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:59,349 INFO L705 BuchiCegarLoop]: Abstraction has 276 states and 335 transitions. [2018-11-29 00:02:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 335 transitions. [2018-11-29 00:02:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2018-11-29 00:02:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-29 00:02:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 324 transitions. [2018-11-29 00:02:59,361 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2018-11-29 00:02:59,361 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2018-11-29 00:02:59,361 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:02:59,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 324 transitions. [2018-11-29 00:02:59,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-29 00:02:59,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:59,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:59,367 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] [2018-11-29 00:02:59,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:59,368 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; 10080#L8 assume !(~n < 1); 10079#L10 assume !(1 == ~n); 10076#L13 call #t~ret0 := fibo2(~n - 1);< 10078#fibo2ENTRY ~n := #in~n; 10077#L18 assume !(~n < 1); 10075#L20 assume !(1 == ~n); 10053#L23 call #t~ret2 := fibo1(~n - 1);< 10064#fibo1ENTRY ~n := #in~n; 10062#L8 assume !(~n < 1); 10060#L10 assume !(1 == ~n); 10057#L13 call #t~ret0 := fibo2(~n - 1);< 10058#fibo2ENTRY ~n := #in~n; 10063#L18 assume !(~n < 1); 10061#L20 assume 1 == ~n;#res := 1; 10059#fibo2FINAL assume true; 10056#fibo2EXIT >#49#return; 10041#L13-1 call #t~ret1 := fibo2(~n - 2);< 10051#fibo2ENTRY ~n := #in~n; 10049#L18 assume !(~n < 1); 10047#L20 assume !(1 == ~n); 10030#L23 call #t~ret2 := fibo1(~n - 1);< 10039#fibo1ENTRY ~n := #in~n; 10037#L8 assume !(~n < 1); 10032#L10 assume !(1 == ~n); 10013#L13 call #t~ret0 := fibo2(~n - 1);< 10028#fibo2ENTRY ~n := #in~n; 10024#L18 assume !(~n < 1); 10018#L20 assume !(1 == ~n); 10010#L23 call #t~ret2 := fibo1(~n - 1);< 10014#fibo1ENTRY ~n := #in~n; 10026#L8 assume !(~n < 1); 10022#L10 assume 1 == ~n;#res := 1; 10016#fibo1FINAL assume true; 10009#fibo1EXIT >#45#return; 10011#L23-1 call #t~ret3 := fibo1(~n - 2);< 10073#fibo1ENTRY ~n := #in~n; 10066#L8 assume ~n < 1;#res := 0; 10067#fibo1FINAL assume true; 10072#fibo1EXIT >#47#return; 10071#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10070#fibo2FINAL assume true; 10068#fibo2EXIT >#49#return; 10042#L13-1 call #t~ret1 := fibo2(~n - 2);< 10052#fibo2ENTRY ~n := #in~n; 10050#L18 assume !(~n < 1); 10048#L20 assume !(1 == ~n); 10031#L23 [2018-11-29 00:02:59,369 INFO L796 eck$LassoCheckResult]: Loop: 10031#L23 call #t~ret2 := fibo1(~n - 1);< 10040#fibo1ENTRY ~n := #in~n; 10038#L8 assume !(~n < 1); 10034#L10 assume !(1 == ~n); 9970#L13 call #t~ret0 := fibo2(~n - 1);< 10029#fibo2ENTRY ~n := #in~n; 10025#L18 assume !(~n < 1); 10020#L20 assume !(1 == ~n); 9982#L23 call #t~ret2 := fibo1(~n - 1);< 10015#fibo1ENTRY ~n := #in~n; 10027#L8 assume !(~n < 1); 10023#L10 assume 1 == ~n;#res := 1; 10017#fibo1FINAL assume true; 10012#fibo1EXIT >#45#return; 9969#L23-1 call #t~ret3 := fibo1(~n - 2);< 9971#fibo1ENTRY ~n := #in~n; 10074#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; 10126#fibo2EXIT >#49#return; 10042#L13-1 call #t~ret1 := fibo2(~n - 2);< 10052#fibo2ENTRY ~n := #in~n; 10050#L18 assume !(~n < 1); 10048#L20 assume !(1 == ~n); 10031#L23 [2018-11-29 00:02:59,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -582096202, now seen corresponding path program 1 times [2018-11-29 00:02:59,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:59,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:59,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-29 00:02:59,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:59,499 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 [2018-11-29 00:02:59,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-29 00:02:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-29 00:02:59,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 1 times [2018-11-29 00:02:59,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:59,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:00,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:00,098 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 [2018-11-29 00:03:00,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:00,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:00,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:03:00,146 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:00,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:03:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:03:00,147 INFO L87 Difference]: Start difference. First operand 270 states and 324 transitions. cyclomatic complexity: 59 Second operand 10 states. [2018-11-29 00:03:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:00,381 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-29 00:03:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:03:00,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 190 transitions. [2018-11-29 00:03:00,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-29 00:03:00,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 128 states and 145 transitions. [2018-11-29 00:03:00,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-11-29 00:03:00,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-11-29 00:03:00,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2018-11-29 00:03:00,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:00,389 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-11-29 00:03:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2018-11-29 00:03:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-11-29 00:03:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-29 00:03:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-11-29 00:03:00,394 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-11-29 00:03:00,394 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-11-29 00:03:00,394 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:00,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 138 transitions. [2018-11-29 00:03:00,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-29 00:03:00,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:00,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:00,398 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] [2018-11-29 00:03:00,398 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] [2018-11-29 00:03:00,398 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; 10682#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); 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); 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 [2018-11-29 00:03:00,398 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 [2018-11-29 00:03:00,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -444366370, now seen corresponding path program 1 times [2018-11-29 00:03:00,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:00,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-29 00:03:00,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:00,624 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 [2018-11-29 00:03:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-29 00:03:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:00,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-29 00:03:00,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:00,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1179096830, now seen corresponding path program 1 times [2018-11-29 00:03:00,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:00,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:00,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:00,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:00,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,252 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-29 00:03:01,577 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-29 00:03:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-29 00:03:01,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:01,788 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 [2018-11-29 00:03:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-29 00:03:01,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:01,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-29 00:03:01,876 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-29 00:03:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-29 00:03:01,876 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. cyclomatic complexity: 19 Second operand 11 states. [2018-11-29 00:03:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:02,018 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-11-29 00:03:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:03:02,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2018-11-29 00:03:02,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-29 00:03:02,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 127 states and 141 transitions. [2018-11-29 00:03:02,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-11-29 00:03:02,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2018-11-29 00:03:02,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 141 transitions. [2018-11-29 00:03:02,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:02,024 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-11-29 00:03:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 141 transitions. [2018-11-29 00:03:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-11-29 00:03:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-29 00:03:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2018-11-29 00:03:02,032 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-11-29 00:03:02,032 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-11-29 00:03:02,033 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:02,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 138 transitions. [2018-11-29 00:03:02,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-29 00:03:02,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:02,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:02,038 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] [2018-11-29 00:03:02,038 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] [2018-11-29 00:03:02,038 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; 11223#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); 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); 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 [2018-11-29 00:03:02,039 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 [2018-11-29 00:03:02,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash -167011978, now seen corresponding path program 1 times [2018-11-29 00:03:02,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:02,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:02,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:02,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-29 00:03:02,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:02,269 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 [2018-11-29 00:03:02,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-29 00:03:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:02,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-29 00:03:02,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:02,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:02,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1468819758, now seen corresponding path program 1 times [2018-11-29 00:03:02,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:02,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:02,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:02,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:02,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:02,894 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:02,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:02,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:02,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:02,894 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:02,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:02,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:02,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:02,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:02,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:02,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:02,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:03,025 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 [2018-11-29 00:03:03,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:03,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:03,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:03,036 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 [2018-11-29 00:03:03,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:03,057 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 [2018-11-29 00:03:03,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:03,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:03,833 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:03,835 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:03,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:03,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:03,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:03,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:03,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:03,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:03,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:03,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:03,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:03,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:03,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:03,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:03,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:03,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:03,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:03,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:03,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:03,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:03,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:03,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:03,973 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:03,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:03,977 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:03,977 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:03,977 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:03,977 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:03,977 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-29 00:03:03,983 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:04,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-29 00:03:04,370 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 [2018-11-29 00:03:04,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-29 00:03:04,484 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. [2018-11-29 00:03:04,486 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 [2018-11-29 00:03:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:03:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-29 00:03:04,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2018-11-29 00:03:04,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:04,487 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:04,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-29 00:03:04,831 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 [2018-11-29 00:03:04,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-29 00:03:05,241 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. [2018-11-29 00:03:05,242 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 [2018-11-29 00:03:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:03:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-29 00:03:05,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2018-11-29 00:03:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:05,244 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:05,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:05,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:05,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-29 00:03:05,701 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 [2018-11-29 00:03:05,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-29 00:03:06,484 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. [2018-11-29 00:03:06,489 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 [2018-11-29 00:03:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:03:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2018-11-29 00:03:06,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 39 letters. [2018-11-29 00:03:06,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:06,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 87 letters. Loop has 39 letters. [2018-11-29 00:03:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 78 letters. [2018-11-29 00:03:06,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:06,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 862 transitions. [2018-11-29 00:03:06,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2018-11-29 00:03:06,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 292 states and 307 transitions. [2018-11-29 00:03:06,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-29 00:03:06,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-29 00:03:06,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 307 transitions. [2018-11-29 00:03:06,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:06,519 INFO L705 BuchiCegarLoop]: Abstraction has 292 states and 307 transitions. [2018-11-29 00:03:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 307 transitions. [2018-11-29 00:03:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2018-11-29 00:03:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-29 00:03:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2018-11-29 00:03:06,536 INFO L728 BuchiCegarLoop]: Abstraction has 242 states and 256 transitions. [2018-11-29 00:03:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:03:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:03:06,537 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand 17 states. [2018-11-29 00:03:06,941 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:07,560 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-11-29 00:03:07,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-29 00:03:07,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 193 transitions. [2018-11-29 00:03:07,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:07,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 122 states and 129 transitions. [2018-11-29 00:03:07,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-11-29 00:03:07,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2018-11-29 00:03:07,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 129 transitions. [2018-11-29 00:03:07,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:07,572 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-29 00:03:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 129 transitions. [2018-11-29 00:03:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-11-29 00:03:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-29 00:03:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-11-29 00:03:07,580 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-29 00:03:07,580 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-29 00:03:07,580 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:03:07,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 128 transitions. [2018-11-29 00:03:07,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:07,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:07,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:07,588 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] [2018-11-29 00:03:07,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:07,591 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 [2018-11-29 00:03:07,591 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 [2018-11-29 00:03:07,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1751159525, now seen corresponding path program 2 times [2018-11-29 00:03:07,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:07,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-29 00:03:08,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:08,077 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 [2018-11-29 00:03:08,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:08,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:08,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:08,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-29 00:03:08,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:08,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-11-29 00:03:08,192 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 2 times [2018-11-29 00:03:08,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:08,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:08,358 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:08,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:08,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:08,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:08,358 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:08,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:08,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:08,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2018-11-29 00:03:08,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:08,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:08,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:08,481 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 [2018-11-29 00:03:08,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,487 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 [2018-11-29 00:03:08,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:08,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:10,279 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:10,282 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:10,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:10,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:10,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:10,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:10,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:10,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:10,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:10,283 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2018-11-29 00:03:10,283 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:10,283 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:10,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,492 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:10,492 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:10,492 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 [2018-11-29 00:03:10,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:10,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:10,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:10,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:10,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:10,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:10,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:10,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:10,508 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:10,508 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:10,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:10,509 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:10,509 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:10,509 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-29 00:03:10,510 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:10,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:10,840 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 [2018-11-29 00:03:10,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-29 00:03:10,962 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. [2018-11-29 00:03:10,963 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 [2018-11-29 00:03:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:03:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:03:10,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 52 letters. Loop has 8 letters. [2018-11-29 00:03:10,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,965 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:11,189 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 [2018-11-29 00:03:11,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-29 00:03:11,325 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. [2018-11-29 00:03:11,335 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 [2018-11-29 00:03:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:03:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-11-29 00:03:11,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 52 letters. Loop has 8 letters. [2018-11-29 00:03:11,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:11,336 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:11,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:11,523 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 [2018-11-29 00:03:11,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-29 00:03:11,677 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. [2018-11-29 00:03:11,678 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 [2018-11-29 00:03:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:03:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-29 00:03:11,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 8 letters. [2018-11-29 00:03:11,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:11,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 60 letters. Loop has 8 letters. [2018-11-29 00:03:11,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:11,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 16 letters. [2018-11-29 00:03:11,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:11,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 201 transitions. [2018-11-29 00:03:11,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:11,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2018-11-29 00:03:11,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:11,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:11,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:11,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:11,685 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:11,685 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:03:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:03:11,685 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 14 states. [2018-11-29 00:03:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:11,686 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:11,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:11,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:11,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:11,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:11,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:11,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:11,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:11,687 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:11,687 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:11,687 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:11,687 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:03:11,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:11,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:11,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:11,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:11 BoogieIcfgContainer [2018-11-29 00:03:11,695 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:11,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:11,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:11,696 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:11,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:41" (3/4) ... [2018-11-29 00:03:11,703 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:11,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:11,704 INFO L168 Benchmark]: Toolchain (without parser) took 31025.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -84.7 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:11,708 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:11,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.54 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:11,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.14 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:11,710 INFO L168 Benchmark]: Boogie Preprocessor took 30.12 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:11,710 INFO L168 Benchmark]: RCFGBuilder took 433.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:11,716 INFO L168 Benchmark]: BuchiAutomizer took 30136.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:11,717 INFO L168 Benchmark]: Witness Printer took 8.09 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:11,729 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.54 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.14 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.12 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 433.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30136.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.2 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. * Witness Printer took 8.09 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. 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 30.0s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 15.8s. Construction of modules took 4.4s. Büchi inclusion checks took 9.0s. 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.4s 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: 15ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...