./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_10_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 1ca069cb8d4103e8fb4700634948424bd87542bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:54:15,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:54:15,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:54:15,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:54:15,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:54:15,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:54:15,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:54:15,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:54:15,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:54:15,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:54:15,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:54:15,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:54:15,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:54:15,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:54:15,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:54:15,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:54:15,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:54:15,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:54:15,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:54:15,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:54:15,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:54:15,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:54:15,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:54:15,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:54:15,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:54:15,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:54:15,431 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:54:15,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:54:15,432 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:54:15,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:54:15,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:54:15,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:54:15,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:54:15,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:54:15,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:54:15,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:54:15,442 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:54:15,460 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:54:15,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:54:15,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:54:15,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:54:15,462 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:54:15,462 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:54:15,462 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:54:15,462 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:54:15,462 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:54:15,464 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:54:15,464 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:54:15,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:54:15,464 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:54:15,464 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:54:15,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:54:15,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:54:15,466 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:54:15,467 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:54:15,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:54:15,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:54:15,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:54:15,467 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:54:15,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:54:15,471 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:54:15,471 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:54:15,472 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:54:15,472 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 -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2019-01-01 23:54:15,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:54:15,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:54:15,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:54:15,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:54:15,554 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:54:15,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-01 23:54:15,623 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ef1855/87a2a2351b6044d69ceb01d6b7ea250d/FLAG171969292 [2019-01-01 23:54:16,123 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:54:16,124 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-01 23:54:16,130 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ef1855/87a2a2351b6044d69ceb01d6b7ea250d/FLAG171969292 [2019-01-01 23:54:16,475 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ef1855/87a2a2351b6044d69ceb01d6b7ea250d [2019-01-01 23:54:16,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:54:16,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:54:16,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:16,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:54:16,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:54:16,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29bbd3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16, skipping insertion in model container [2019-01-01 23:54:16,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:54:16,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:54:16,744 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:16,749 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:54:16,767 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:16,785 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:54:16,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16 WrapperNode [2019-01-01 23:54:16,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:16,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:16,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:54:16,787 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:54:16,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:16,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:54:16,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:54:16,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:54:16,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... [2019-01-01 23:54:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:54:16,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:54:16,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:54:16,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:54:16,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:54:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:54:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-01 23:54:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-01 23:54:17,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:54:17,279 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:54:17,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:17 BoogieIcfgContainer [2019-01-01 23:54:17,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:54:17,280 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:54:17,280 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:54:17,284 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:54:17,285 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:17,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:54:16" (1/3) ... [2019-01-01 23:54:17,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e381607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:17, skipping insertion in model container [2019-01-01 23:54:17,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:17,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:16" (2/3) ... [2019-01-01 23:54:17,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e381607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:17, skipping insertion in model container [2019-01-01 23:54:17,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:17,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:17" (3/3) ... [2019-01-01 23:54:17,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2019-01-01 23:54:17,396 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:54:17,397 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:54:17,397 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:54:17,397 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:54:17,397 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:54:17,397 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:54:17,398 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:54:17,398 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:54:17,398 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:54:17,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 23:54:17,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:17,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:17,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:17,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:17,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:17,479 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:54:17,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 23:54:17,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:17,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:17,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:17,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:17,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:17,501 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-01 23:54:17,501 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-01-01 23:54:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-01 23:54:17,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-01 23:54:17,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:17,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-01 23:54:17,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:17,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:17,851 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:17,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:17,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:17,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:17,852 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:17,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:17,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:17,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:17,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:17,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:17,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:17,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:17,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:17,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:17,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:17,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:18,128 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:18,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:18,142 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:18,162 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:18,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:18,198 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:18,206 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:18,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:18,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:18,248 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:18,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:18,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:18,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:18,297 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:18,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:18,369 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:18,371 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:18,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:18,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:18,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:18,372 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:18,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:18,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:18,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:18,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:18,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:18,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:18,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:18,578 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:18,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:18,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:18,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:18,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:18,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:18,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:18,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:18,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:18,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:18,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:18,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:18,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:18,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:18,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:18,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:18,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:18,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:18,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:18,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:18,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:18,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:18,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:18,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:18,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:18,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:18,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:18,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:18,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:18,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:18,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:18,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:18,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:18,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:18,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:18,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:18,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:18,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:18,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:18,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:18,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:18,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:18,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:18,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:18,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:18,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:18,635 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:18,636 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:18,638 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:18,638 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:18,639 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:18,639 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-01 23:54:18,641 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:18,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:18,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:19,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:54:19,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-01 23:54:19,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-01-01 23:54:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 23:54:19,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 23:54:19,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:19,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 23:54:19,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:19,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 23:54:19,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:19,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-01 23:54:19,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:19,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-01 23:54:19,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 23:54:19,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 23:54:19,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-01 23:54:19,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:19,533 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 23:54:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-01 23:54:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-01 23:54:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 23:54:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-01 23:54:19,565 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 23:54:19,565 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 23:54:19,565 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:54:19,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-01 23:54:19,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:19,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:19,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:19,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:19,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:19,569 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-01 23:54:19,569 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-01-01 23:54:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-01 23:54:19,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:19,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:54:19,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:19,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:19,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-01 23:54:19,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:19,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:19,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:19,868 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2019-01-01 23:54:20,024 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-01 23:54:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:54:20,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:20,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:20,191 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:54:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:54:20,196 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 23:54:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:20,385 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-01 23:54:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:54:20,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-01 23:54:20,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:20,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-01 23:54:20,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 23:54:20,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 23:54:20,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-01 23:54:20,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:20,393 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:54:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-01 23:54:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 23:54:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 23:54:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-01 23:54:20,398 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:54:20,398 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 23:54:20,399 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:54:20,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-01 23:54:20,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:20,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:20,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:20,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:20,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:20,401 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-01 23:54:20,402 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2019-01-01 23:54:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-01 23:54:20,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:20,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:20,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:20,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:20,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:20,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 23:54:20,524 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-01 23:54:20,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:20,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:20,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:20,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:20,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:20,738 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:20,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:20,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:20,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:20,739 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:20,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:20,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:20,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:20,740 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:20,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:20,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:20,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:20,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:20,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:20,874 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:20,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:20,878 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:20,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:20,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:21,593 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:21,595 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:21,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:21,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:21,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:21,596 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:21,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:21,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:21,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:21,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:21,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:21,597 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:21,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:21,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:21,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:21,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:21,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:21,797 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:21,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:21,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:21,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:21,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:21,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:21,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:21,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:21,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:21,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:21,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:21,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:21,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:21,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:21,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:21,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:21,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:21,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:21,827 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:21,827 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:21,827 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:21,828 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:21,828 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:21,828 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:21,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:21,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:22,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:54:22,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-01 23:54:22,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-01-01 23:54:22,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:54:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-01 23:54:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 23:54:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-01 23:54:22,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:22,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-01 23:54:22,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:22,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-01 23:54:22,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:54:22,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-01 23:54:22,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-01 23:54:22,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:54:22,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-01 23:54:22,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:22,420 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-01 23:54:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-01 23:54:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-01 23:54:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 23:54:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-01 23:54:22,439 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-01 23:54:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:54:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:54:22,439 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-01 23:54:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:22,569 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-01 23:54:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:54:22,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-01 23:54:22,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:54:22,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-01 23:54:22,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-01 23:54:22,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:54:22,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-01 23:54:22,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:22,582 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-01 23:54:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-01 23:54:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-01 23:54:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 23:54:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-01 23:54:22,597 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-01 23:54:22,597 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-01 23:54:22,597 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:54:22,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-01 23:54:22,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 23:54:22,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:22,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:22,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:22,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:22,604 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-01 23:54:22,604 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2019-01-01 23:54:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-01 23:54:22,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:22,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:22,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 23:54:22,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:22,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:22,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:22,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 23:54:22,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:22,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 23:54:22,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-01 23:54:22,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:22,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:22,946 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:22,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:22,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:22,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:22,947 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:22,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:22,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:22,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:22,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-01 23:54:22,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:22,948 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:22,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:22,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:22,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:23,046 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:23,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:23,050 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:23,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:23,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:23,761 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:23,763 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:23,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:23,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:23,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:23,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:23,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:23,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:23,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:23,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-01 23:54:23,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:23,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:23,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:23,844 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:23,844 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:23,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:23,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:23,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:23,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:23,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:23,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:23,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:23,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:23,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:23,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:23,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:23,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:23,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:23,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:23,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:23,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:23,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:23,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:23,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:23,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:23,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:23,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:23,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:23,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:23,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:23,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:23,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:23,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:23,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:23,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:23,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:23,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:23,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:23,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:23,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:23,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:23,897 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:23,900 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:23,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:23,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:23,900 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:23,901 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:23,901 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:23,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:24,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:24,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:54:24,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:54:24,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2019-01-01 23:54:24,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:54:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-01 23:54:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:54:24,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:24,359 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:24,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:24,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:24,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:24,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:54:24,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:54:24,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2019-01-01 23:54:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:54:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-01 23:54:24,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:54:24,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:24,719 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:24,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:24,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:25,061 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:54:25,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 23:54:25,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2019-01-01 23:54:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:54:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-01 23:54:25,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-01 23:54:25,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:25,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-01 23:54:25,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:25,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-01 23:54:25,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:25,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-01 23:54:25,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-01 23:54:25,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-01 23:54:25,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-01 23:54:25,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-01 23:54:25,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-01 23:54:25,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:25,390 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-01 23:54:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-01 23:54:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-01 23:54:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-01 23:54:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-01 23:54:25,445 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-01 23:54:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:54:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:54:25,446 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-01 23:54:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:26,110 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-01 23:54:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:54:26,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-01 23:54:26,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-01 23:54:26,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-01 23:54:26,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-01 23:54:26,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-01 23:54:26,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-01 23:54:26,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:26,146 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-01 23:54:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-01 23:54:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-01 23:54:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-01 23:54:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-01 23:54:26,216 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-01 23:54:26,217 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-01 23:54:26,217 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:54:26,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-01 23:54:26,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:54:26,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:26,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:26,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:26,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:26,225 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-01 23:54:26,225 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-01 23:54:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-01 23:54:26,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:26,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:26,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 23:54:26,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:26,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:26,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:54:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-01 23:54:26,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-01 23:54:26,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:26,548 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:26,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:26,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:26,548 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:26,549 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:26,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:26,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:26,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:26,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:26,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:26,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:26,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,602 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:26,602 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:26,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:26,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:26,610 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:26,610 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:26,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:26,634 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:26,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:26,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:26,708 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:26,712 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:26,713 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:26,713 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:26,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:26,713 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:26,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:26,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:26,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:26,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:26,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:26,714 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:26,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:26,831 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:26,831 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:26,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:26,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:26,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:26,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:26,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:26,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:26,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:26,839 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:26,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:26,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:26,842 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:26,842 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:26,842 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:26,842 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-01 23:54:26,842 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:26,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:26,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:27,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:54:27,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-01 23:54:27,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-01 23:54:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:54:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 23:54:27,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:54:27,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:27,205 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:27,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:27,744 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:54:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:27,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:27,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:54:27,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-01 23:54:27,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-01 23:54:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:54:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 23:54:27,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:54:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:27,850 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:27,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:28,101 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:54:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:28,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:28,142 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:54:28,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-01 23:54:28,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2019-01-01 23:54:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:54:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 23:54:28,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 23:54:28,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:28,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-01 23:54:28,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:28,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-01 23:54:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:28,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-01 23:54:28,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:54:28,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-01 23:54:28,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-01 23:54:28,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-01 23:54:28,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-01 23:54:28,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:28,265 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-01 23:54:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-01 23:54:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-01 23:54:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-01 23:54:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-01 23:54:28,290 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-01 23:54:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 23:54:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 23:54:28,292 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-01 23:54:28,552 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 23:54:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:29,109 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-01 23:54:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 23:54:29,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-01 23:54:29,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:29,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-01 23:54:29,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-01 23:54:29,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-01 23:54:29,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-01 23:54:29,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:29,121 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-01 23:54:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-01 23:54:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-01 23:54:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-01 23:54:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-01 23:54:29,132 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-01 23:54:29,132 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-01 23:54:29,132 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:54:29,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-01 23:54:29,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:29,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:29,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:29,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:29,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:29,139 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-01 23:54:29,140 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-01 23:54:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2019-01-01 23:54:29,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:29,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-01 23:54:29,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:29,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:29,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:54:29,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:54:29,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:29,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 23:54:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-01 23:54:29,557 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-01-01 23:54:29,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:29,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:29,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:29,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:29,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:29,616 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:29,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:29,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:29,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:29,617 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:29,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:29,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:29,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:29,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-01 23:54:29,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:29,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:29,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:29,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:29,782 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:54:29,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:29,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:30,242 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-01 23:54:30,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:30,343 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:30,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:30,349 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:30,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:30,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:30,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:30,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:30,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:30,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:37,994 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:37,997 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:37,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:37,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:37,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:37,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:37,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:37,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:37,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:37,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-01 23:54:37,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:37,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:38,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:38,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:38,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:38,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:38,064 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:38,064 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:38,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:38,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:38,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:38,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:38,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:38,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:38,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:38,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:38,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:38,074 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:38,074 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:38,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:38,075 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:38,075 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:38,075 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:38,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:38,256 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:38,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-01 23:54:38,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2019-01-01 23:54:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-01 23:54:38,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:54:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:38,339 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:38,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:38,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-01 23:54:38,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2019-01-01 23:54:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 23:54:38,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:54:38,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:38,599 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:38,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:38,760 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 4 loop predicates [2019-01-01 23:54:38,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-01 23:54:38,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2019-01-01 23:54:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:54:38,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:54:38,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:38,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-01 23:54:38,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:38,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-01 23:54:38,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:38,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-01 23:54:38,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:38,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-01 23:54:38,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-01 23:54:38,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-01 23:54:38,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-01 23:54:38,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:38,975 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-01 23:54:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-01 23:54:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-01 23:54:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-01 23:54:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-01 23:54:38,985 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-01 23:54:38,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 23:54:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-01 23:54:38,987 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-01 23:54:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:39,479 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2019-01-01 23:54:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 23:54:39,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2019-01-01 23:54:39,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:39,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2019-01-01 23:54:39,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-01 23:54:39,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-01 23:54:39,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2019-01-01 23:54:39,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:39,491 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2019-01-01 23:54:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2019-01-01 23:54:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2019-01-01 23:54:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-01 23:54:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-01 23:54:39,504 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-01 23:54:39,504 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-01 23:54:39,504 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:54:39,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2019-01-01 23:54:39,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:39,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:39,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:39,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-01 23:54:39,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:39,511 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-01 23:54:39,512 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-01 23:54:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2019-01-01 23:54:39,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:39,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:39,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-01 23:54:39,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:39,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:39,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 23:54:39,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-01 23:54:39,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:39,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-01 23:54:39,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 23:54:39,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-01-01 23:54:39,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:39,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:39,742 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:39,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:39,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:39,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:39,743 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:39,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:39,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:39,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:39,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-01 23:54:39,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:39,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:39,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:39,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:39,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:39,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:39,817 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:39,818 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:39,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:39,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:39,828 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:39,828 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:39,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:39,850 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:39,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:39,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:40,933 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:40,935 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:40,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:40,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:40,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:40,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:40,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:40,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:40,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:40,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-01 23:54:40,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:40,936 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:40,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:40,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:40,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:40,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:41,003 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:41,003 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:41,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:41,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:41,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:41,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:41,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:41,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:41,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:41,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:41,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:41,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:41,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:41,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:41,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:41,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:41,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:41,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:41,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:41,012 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:41,019 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:41,020 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:41,020 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:41,020 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:41,020 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:41,020 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:41,021 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:41,192 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:41,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-01 23:54:41,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2019-01-01 23:54:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-01 23:54:41,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-01 23:54:41,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,259 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:41,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:41,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-01 23:54:41,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2019-01-01 23:54:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 23:54:41,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-01 23:54:41,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,590 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:41,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:41,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:41,798 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 4 loop predicates [2019-01-01 23:54:41,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-01 23:54:41,871 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2019-01-01 23:54:41,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:54:41,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-01 23:54:41,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-01-01 23:54:41,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-01 23:54:41,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:41,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2019-01-01 23:54:41,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:41,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2019-01-01 23:54:41,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-01 23:54:41,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2019-01-01 23:54:41,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2019-01-01 23:54:41,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:41,892 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2019-01-01 23:54:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2019-01-01 23:54:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2019-01-01 23:54:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-01 23:54:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-01 23:54:41,906 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-01 23:54:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 23:54:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 23:54:41,909 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2019-01-01 23:54:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:42,550 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2019-01-01 23:54:42,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 23:54:42,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2019-01-01 23:54:42,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:42,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2019-01-01 23:54:42,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2019-01-01 23:54:42,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2019-01-01 23:54:42,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2019-01-01 23:54:42,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:42,565 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2019-01-01 23:54:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2019-01-01 23:54:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2019-01-01 23:54:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-01 23:54:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-01 23:54:42,580 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-01 23:54:42,580 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-01 23:54:42,580 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:54:42,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2019-01-01 23:54:42,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:42,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:42,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:42,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2019-01-01 23:54:42,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:42,589 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-01 23:54:42,589 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-01 23:54:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2019-01-01 23:54:42,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:42,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:42,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-01 23:54:42,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:42,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 23:54:42,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 23:54:42,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:42,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-01 23:54:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2019-01-01 23:54:42,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2019-01-01 23:54:42,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:42,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:42,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:43,012 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:43,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:43,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:43,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:43,013 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:43,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:43,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:43,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:43,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2019-01-01 23:54:43,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:43,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:43,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:43,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:43,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:43,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:43,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:43,118 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:43,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:43,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:43,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:43,125 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:43,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:43,147 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:43,150 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:43,150 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:43,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:43,171 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:43,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:43,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:44,078 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:44,080 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:44,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:44,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:44,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:44,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:44,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:44,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:44,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:44,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2019-01-01 23:54:44,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:44,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:44,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:44,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:44,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:44,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:44,258 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:54:44,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:44,260 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:44,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:44,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:44,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:44,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:44,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:44,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:44,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:44,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:44,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:44,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:44,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:44,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:44,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:44,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:44,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:44,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:44,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:44,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:44,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:44,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:44,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:44,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:44,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:44,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:44,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:44,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:44,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:44,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:44,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:44,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:44,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:44,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:44,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:44,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:44,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:44,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:44,284 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:44,284 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:44,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:44,288 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:44,288 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:44,288 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:44,288 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:44,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:44,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:44,554 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:44,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-01 23:54:44,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2019-01-01 23:54:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-01 23:54:44,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-01 23:54:44,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:44,616 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:44,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:44,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:44,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:44,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-01 23:54:44,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2019-01-01 23:54:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 23:54:44,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-01 23:54:44,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:44,907 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:45,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:45,110 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 4 loop predicates [2019-01-01 23:54:45,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-01 23:54:45,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2019-01-01 23:54:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:54:45,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-01 23:54:45,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:45,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2019-01-01 23:54:45,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:45,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2019-01-01 23:54:45,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:45,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2019-01-01 23:54:45,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:45,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2019-01-01 23:54:45,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-01 23:54:45,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2019-01-01 23:54:45,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2019-01-01 23:54:45,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:45,259 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-01 23:54:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2019-01-01 23:54:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-01-01 23:54:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-01 23:54:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-01 23:54:45,275 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-01 23:54:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 23:54:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-01-01 23:54:45,277 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2019-01-01 23:54:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:46,223 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2019-01-01 23:54:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 23:54:46,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2019-01-01 23:54:46,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:46,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2019-01-01 23:54:46,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-01-01 23:54:46,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-01-01 23:54:46,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2019-01-01 23:54:46,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:46,240 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2019-01-01 23:54:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2019-01-01 23:54:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2019-01-01 23:54:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-01 23:54:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-01 23:54:46,260 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-01 23:54:46,260 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-01 23:54:46,260 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:54:46,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2019-01-01 23:54:46,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:46,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:46,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:46,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1] [2019-01-01 23:54:46,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:46,271 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14905#fiboENTRY ~n := #in~n; 15099#L6 assume !(~n < 1); 15095#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15090#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(1 == ~n); 15059#L11 call #t~ret0 := fibo(~n - 1);< 15066#fiboENTRY ~n := #in~n; 15064#L6 assume !(~n < 1); 15062#L8 assume !(1 == ~n); 15054#L11 call #t~ret0 := fibo(~n - 1);< 15058#fiboENTRY ~n := #in~n; 15057#L6 assume !(~n < 1); 15055#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14979#L6 assume !(~n < 1); 14976#L8 assume !(1 == ~n); 14932#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14959#L6 assume !(~n < 1); 15218#L8 assume 1 == ~n;#res := 1; 15217#fiboFINAL assume true; 15216#fiboEXIT >#32#return; 15214#L11-1 call #t~ret1 := fibo(~n - 2);< 15215#fiboENTRY ~n := #in~n; 15227#L6 assume ~n < 1;#res := 0; 15224#fiboFINAL assume true; 15213#fiboEXIT >#34#return; 15211#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15209#fiboFINAL assume true; 15208#fiboEXIT >#32#return; 15044#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15234#L6 assume !(~n < 1); 15053#L8 assume 1 == ~n;#res := 1; 14924#fiboFINAL assume true; 15043#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15027#fiboFINAL assume true; 15012#fiboEXIT >#32#return; 14986#L11-1 call #t~ret1 := fibo(~n - 2);< 14988#fiboENTRY ~n := #in~n; 15056#L6 assume !(~n < 1); 15052#L8 assume !(1 == ~n); 15022#L11 call #t~ret0 := fibo(~n - 1);< 15228#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15047#L8 assume 1 == ~n;#res := 1; 15036#fiboFINAL assume true; 15019#fiboEXIT >#32#return; 14996#L11-1 call #t~ret1 := fibo(~n - 2);< 15001#fiboENTRY ~n := #in~n; 15035#L6 assume ~n < 1;#res := 0; 15018#fiboFINAL assume true; 14993#fiboEXIT >#34#return; 14992#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14990#fiboFINAL assume true; 14985#fiboEXIT >#34#return; 14980#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14950#fiboFINAL assume true; 14942#fiboEXIT >#32#return; 14923#L11-1 call #t~ret1 := fibo(~n - 2);< 14934#fiboENTRY ~n := #in~n; 14928#L6 assume !(~n < 1); 14922#L8 assume !(1 == ~n); 14925#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15195#L8 assume !(1 == ~n); 15189#L11 call #t~ret0 := fibo(~n - 1);< 15191#fiboENTRY ~n := #in~n; 15148#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15188#fiboEXIT >#32#return; 15181#L11-1 call #t~ret1 := fibo(~n - 2);< 15187#fiboENTRY ~n := #in~n; 15198#L6 assume ~n < 1;#res := 0; 15142#fiboFINAL assume true; 15179#fiboEXIT >#34#return; 15185#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15204#fiboFINAL assume true; 15203#fiboEXIT >#32#return; 15042#L11-1 call #t~ret1 := fibo(~n - 2);< 15045#fiboENTRY ~n := #in~n; 15232#L6 assume !(~n < 1); 15048#L8 assume 1 == ~n;#res := 1; 15038#fiboFINAL assume true; 15041#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15027#fiboFINAL assume true; 15012#fiboEXIT >#34#return; 14944#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15221#fiboFINAL assume true; 15013#fiboEXIT >#32#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 15146#L6 assume !(~n < 1); 14977#L8 assume !(1 == ~n); 14978#L11 call #t~ret0 := fibo(~n - 1);< 15024#fiboENTRY ~n := #in~n; 15229#L6 assume !(~n < 1); 15266#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2019-01-01 23:54:46,271 INFO L796 eck$LassoCheckResult]: Loop: 14883#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2019-01-01 23:54:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 79280042, now seen corresponding path program 5 times [2019-01-01 23:54:46,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:46,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2019-01-01 23:54:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 477112511, now seen corresponding path program 6 times [2019-01-01 23:54:46,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-01-01 23:54:47,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:47,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:47,127 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 23:54:47,288 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-01-01 23:54:47,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:47,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-01-01 23:54:47,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2019-01-01 23:54:47,653 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:47,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:47,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:47,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:47,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:47,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:47,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:47,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:47,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-01 23:54:47,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:47,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:47,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:47,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:47,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:47,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:47,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:47,770 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:47,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:47,779 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:47,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:47,845 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:55,035 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:55,037 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:55,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:55,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:55,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:55,037 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:55,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:55,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:55,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:55,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-01 23:54:55,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:55,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:55,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:55,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:55,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:55,094 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:55,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:55,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:55,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:55,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:55,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:55,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:55,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:55,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:55,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:55,104 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:55,106 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:55,106 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:55,107 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:55,107 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:55,107 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:55,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-01 23:54:55,107 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:55,408 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:55,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-01 23:54:55,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2019-01-01 23:54:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-01 23:54:55,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-01 23:54:55,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:55,478 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:56,152 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:54:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:56,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:56,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 23:54:56,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-01 23:54:57,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2019-01-01 23:54:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 23:54:57,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-01 23:54:57,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:57,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:57,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:57,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:57,423 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 4 loop predicates [2019-01-01 23:54:57,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-01 23:54:57,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2019-01-01 23:54:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:54:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-01 23:54:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2019-01-01 23:54:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 8 letters. [2019-01-01 23:54:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:57,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2019-01-01 23:54:57,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 23:54:57,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2019-01-01 23:54:57,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2019-01-01 23:54:57,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 23:54:57,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2019-01-01 23:54:57,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:57,506 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2019-01-01 23:54:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2019-01-01 23:54:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2019-01-01 23:54:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-01 23:54:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-01 23:54:57,522 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-01 23:54:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 23:54:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-01-01 23:54:57,523 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 25 states. [2019-01-01 23:54:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:58,395 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2019-01-01 23:54:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 23:54:58,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 864 transitions. [2019-01-01 23:54:58,403 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:58,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 0 states and 0 transitions. [2019-01-01 23:54:58,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:58,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:58,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:58,404 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,404 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,404 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:58,404 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:54:58,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:54:58,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:58,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:54:58,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:58 BoogieIcfgContainer [2019-01-01 23:54:58,412 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:58,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:58,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:58,413 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:58,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:17" (3/4) ... [2019-01-01 23:54:58,417 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:54:58,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:58,418 INFO L168 Benchmark]: Toolchain (without parser) took 41937.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 951.4 MB in the beginning and 934.9 MB in the end (delta: 16.5 MB). Peak memory consumption was 353.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,419 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,420 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,421 INFO L168 Benchmark]: RCFGBuilder took 421.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,422 INFO L168 Benchmark]: BuchiAutomizer took 41131.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 171.7 MB). Peak memory consumption was 385.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:58,423 INFO L168 Benchmark]: Witness Printer took 4.68 ms. Allocated memory is still 1.4 GB. Free memory is still 934.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:58,427 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41131.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 171.7 MB). Peak memory consumption was 385.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.68 ms. Allocated memory is still 1.4 GB. Free memory is still 934.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 26.1s. Construction of modules took 4.3s. Büchi inclusion checks took 9.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 330 SDtfs, 948 SDslu, 470 SDs, 0 SdLazy, 1976 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 18.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...