./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_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 e21c3699338992ddad7e6d15f4351c8cc3315b0b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:03:04,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:04,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:04,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:04,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:04,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:04,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:04,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:04,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:04,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:04,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:04,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:04,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:04,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:04,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:04,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:04,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:04,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:04,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:04,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:04,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:04,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:04,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:04,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:04,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:04,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:04,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:04,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:04,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:04,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:04,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:04,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:04,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:04,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:04,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:04,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:04,538 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:03:04,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:04,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:04,559 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:04,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:04,559 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:04,559 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:04,559 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:04,560 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:04,560 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:04,560 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:04,561 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:04,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:04,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:04,562 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:04,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:04,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:04,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:04,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:04,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:04,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:04,564 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:04,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:04,564 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:04,564 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:04,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:04,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:04,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:04,566 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:04,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:04,566 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:04,566 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:04,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:04,568 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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-29 00:03:04,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:04,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:04,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:04,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:04,627 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:04,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-29 00:03:04,698 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9318781c4/87e6c3ccdee7408794e3839572564f35/FLAGe8bd1f49c [2018-11-29 00:03:05,174 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:05,175 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-29 00:03:05,181 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9318781c4/87e6c3ccdee7408794e3839572564f35/FLAGe8bd1f49c [2018-11-29 00:03:05,531 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9318781c4/87e6c3ccdee7408794e3839572564f35 [2018-11-29 00:03:05,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:05,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:05,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:05,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:05,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:05,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a57947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05, skipping insertion in model container [2018-11-29 00:03:05,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:05,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:05,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:05,837 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:05,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:05,893 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:05,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05 WrapperNode [2018-11-29 00:03:05,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:05,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:05,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:05,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:05,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:05,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:05,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:05,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:05,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:05,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:05,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:05,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:05,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-29 00:03:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-29 00:03:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-29 00:03:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-29 00:03:06,605 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:06,606 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:06,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06 BoogieIcfgContainer [2018-11-29 00:03:06,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:06,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:06,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:06,613 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:06,614 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:05" (1/3) ... [2018-11-29 00:03:06,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bf93d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,616 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (2/3) ... [2018-11-29 00:03:06,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bf93d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,617 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/3) ... [2018-11-29 00:03:06,619 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-29 00:03:06,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:06,692 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:06,692 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:06,692 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:06,693 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:06,693 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:06,693 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:06,694 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:06,694 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:06,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,776 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:06,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,804 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2018-11-29 00:03:06,806 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2018-11-29 00:03:06,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-11-29 00:03:06,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-11-29 00:03:06,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-11-29 00:03:06,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,417 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-29 00:03:07,448 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:07,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:07,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:07,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:07,450 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:07,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:07,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:07,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:07,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:07,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:07,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:07,837 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,850 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,879 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,879 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:07,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,943 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,954 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:07,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,990 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,036 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,060 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,083 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,129 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:08,158 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,214 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:08,217 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:08,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:08,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:08,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:08,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:08,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:08,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:08,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:08,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:08,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:08,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,670 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:08,684 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:08,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:08,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:08,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:08,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:08,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:08,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:08,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:08,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:08,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:08,802 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:08,810 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:08,813 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:08,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:08,816 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:08,817 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:08,817 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-29 00:03:08,822 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:09,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:09,376 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:03:09,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-11-29 00:03:09,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2018-11-29 00:03:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-29 00:03:09,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:09,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:09,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-29 00:03:09,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:09,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-29 00:03:09,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:09,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-11-29 00:03:09,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-11-29 00:03:10,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-29 00:03:10,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-29 00:03:10,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,017 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-11-29 00:03:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-29 00:03:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-29 00:03:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-11-29 00:03:10,062 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,062 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,062 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:10,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-11-29 00:03:10,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,068 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2018-11-29 00:03:10,068 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2018-11-29 00:03:10,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-11-29 00:03:10,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:10,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,232 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-11-29 00:03:10,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:10,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:10,334 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-29 00:03:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:10,558 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-29 00:03:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:10,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-11-29 00:03:10,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-11-29 00:03:10,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-29 00:03:10,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-29 00:03:10,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,571 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-11-29 00:03:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-29 00:03:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-29 00:03:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-29 00:03:10,592 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,592 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,592 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:10,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-11-29 00:03:10,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,601 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2018-11-29 00:03:10,601 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2018-11-29 00:03:10,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-11-29 00:03:10,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:10,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:10,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:10,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:10,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-29 00:03:10,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-11-29 00:03:10,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,061 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:11,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:11,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,170 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,170 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,181 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,220 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,243 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:11,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,181 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:12,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:12,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:12,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:12,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:12,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:12,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:12,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:12,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:12,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:12,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:12,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:12,402 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:12,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:12,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:12,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:12,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:12,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:12,440 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:12,441 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:12,441 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:12,441 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:12,441 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-29 00:03:12,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:12,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:13,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:13,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-29 00:03:13,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2018-11-29 00:03:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-29 00:03:13,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-29 00:03:13,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-11-29 00:03:13,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-11-29 00:03:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-11-29 00:03:13,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-11-29 00:03:13,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-29 00:03:13,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:03:13,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,438 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-11-29 00:03:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-11-29 00:03:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-29 00:03:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-11-29 00:03:13,460 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-11-29 00:03:13,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:03:13,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:03:13,461 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-11-29 00:03:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:13,692 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-11-29 00:03:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:03:13,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-11-29 00:03:13,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-11-29 00:03:13,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:03:13,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:03:13,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,709 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-11-29 00:03:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-11-29 00:03:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-29 00:03:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-11-29 00:03:13,729 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,729 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:13,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-11-29 00:03:13,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:13,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:13,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,739 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,739 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-11-29 00:03:13,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-29 00:03:13,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:13,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:13,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-29 00:03:14,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-11-29 00:03:14,342 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-11-29 00:03:14,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-29 00:03:14,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:03:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:03:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-29 00:03:14,505 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:14,505 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-29 00:03:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:14,600 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-11-29 00:03:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:14,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-11-29 00:03:14,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-11-29 00:03:14,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-29 00:03:14,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-29 00:03:14,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,620 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-11-29 00:03:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-11-29 00:03:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-29 00:03:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-29 00:03:14,636 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,636 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,636 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:14,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-11-29 00:03:14,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:14,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,645 INFO L794 eck$LassoCheckResult]: Stem: 1915#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1878#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1884#fibo1ENTRY ~n := #in~n; 1921#L8 assume !(~n < 1); 1877#L10 assume !(1 == ~n); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1898#fibo2ENTRY ~n := #in~n; 1919#L18 assume !(~n < 1); 1992#L20 assume !(1 == ~n); 1903#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume 1 == ~n;#res := 1; 1872#fibo2FINAL assume true; 1873#fibo2EXIT >#49#return; 1868#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1925#L18 assume !(~n < 1); 1923#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1946#L8 assume !(~n < 1); 1953#L10 assume 1 == ~n;#res := 1; 1954#fibo1FINAL assume true; 1947#fibo1EXIT >#45#return; 1875#L23-1 call #t~ret3 := fibo1(~n - 2);< 1883#fibo1ENTRY ~n := #in~n; 1943#L8 assume !(~n < 1); 1940#L10 assume !(1 == ~n); 1882#L13 call #t~ret0 := fibo2(~n - 1);< 1936#fibo2ENTRY ~n := #in~n; 1934#L18 assume !(~n < 1); 1929#L20 assume 1 == ~n;#res := 1; 1930#fibo2FINAL assume true; 1920#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#45#return; 1975#L23-1 call #t~ret3 := fibo1(~n - 2);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#49#return; 1916#L13-1 [2018-11-29 00:03:14,645 INFO L796 eck$LassoCheckResult]: Loop: 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1977#L23 call #t~ret2 := fibo1(~n - 1);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 [2018-11-29 00:03:14,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-11-29 00:03:14,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-29 00:03:14,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:14,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:14,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:14,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-29 00:03:15,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:15,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-11-29 00:03:15,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:15,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-11-29 00:03:15,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,567 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-29 00:03:15,582 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,582 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:15,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:15,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:15,722 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,732 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:15,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,804 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,809 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,809 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,833 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,856 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,856 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,880 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,906 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,936 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:15,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:17,482 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:17,484 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:17,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:17,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:17,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:17,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:17,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:17,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:17,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:17,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:17,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:17,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:17,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:17,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:17,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:17,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:17,728 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:17,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:17,728 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:17,729 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:17,729 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-29 00:03:17,729 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:17,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:18,398 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:18,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:18,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2018-11-29 00:03:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-29 00:03:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:18,851 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:19,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:20,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:20,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:20,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2018-11-29 00:03:20,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-29 00:03:20,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:20,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,627 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:20,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:21,290 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:21,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:21,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2018-11-29 00:03:21,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-29 00:03:21,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:21,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-11-29 00:03:21,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-11-29 00:03:21,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-11-29 00:03:21,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-29 00:03:21,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-11-29 00:03:21,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-11-29 00:03:21,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-11-29 00:03:21,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:21,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,788 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-11-29 00:03:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-11-29 00:03:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-29 00:03:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-11-29 00:03:21,868 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-11-29 00:03:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:03:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:03:21,870 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2018-11-29 00:03:22,286 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:22,787 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-29 00:03:23,324 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:24,093 INFO L93 Difference]: Finished difference Result 416 states and 562 transitions. [2018-11-29 00:03:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:24,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 562 transitions. [2018-11-29 00:03:24,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:24,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 367 states and 504 transitions. [2018-11-29 00:03:24,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-29 00:03:24,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2018-11-29 00:03:24,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 504 transitions. [2018-11-29 00:03:24,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:24,108 INFO L705 BuchiCegarLoop]: Abstraction has 367 states and 504 transitions. [2018-11-29 00:03:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 504 transitions. [2018-11-29 00:03:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-11-29 00:03:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-29 00:03:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2018-11-29 00:03:24,122 INFO L728 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-11-29 00:03:24,122 INFO L608 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-11-29 00:03:24,122 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:24,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 444 transitions. [2018-11-29 00:03:24,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:24,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:24,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:24,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:24,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2018-11-29 00:03:24,128 INFO L794 eck$LassoCheckResult]: Stem: 8098#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8064#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8065#fibo1ENTRY ~n := #in~n; 8160#L8 assume !(~n < 1); 8155#L10 assume !(1 == ~n); 8135#L13 call #t~ret0 := fibo2(~n - 1);< 8152#fibo2ENTRY ~n := #in~n; 8169#L18 assume !(~n < 1); 8134#L20 assume !(1 == ~n); 8136#L23 call #t~ret2 := fibo1(~n - 1);< 8164#fibo1ENTRY ~n := #in~n; 8161#L8 assume !(~n < 1); 8156#L10 assume !(1 == ~n); 8035#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8162#L8 assume !(~n < 1); 8157#L10 assume !(1 == ~n); 8036#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8165#L8 assume !(~n < 1); 8296#L10 assume 1 == ~n;#res := 1; 8292#fibo1FINAL assume true; 8206#fibo1EXIT >#45#return; 8202#L23-1 call #t~ret3 := fibo1(~n - 2);< 8203#fibo1ENTRY ~n := #in~n; 8208#L8 assume ~n < 1;#res := 0; 8205#fibo1FINAL assume true; 8201#fibo1EXIT >#47#return; 8199#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8198#fibo2FINAL assume true; 8194#fibo2EXIT >#49#return; 8129#L13-1 [2018-11-29 00:03:24,129 INFO L796 eck$LassoCheckResult]: Loop: 8129#L13-1 call #t~ret1 := fibo2(~n - 2);< 8092#fibo2ENTRY ~n := #in~n; 8131#L18 assume !(~n < 1); 8130#L20 assume !(1 == ~n); 8091#L23 call #t~ret2 := fibo1(~n - 1);< 8126#fibo1ENTRY ~n := #in~n; 8125#L8 assume !(~n < 1); 8121#L10 assume !(1 == ~n); 8123#L13 call #t~ret0 := fibo2(~n - 1);< 8196#fibo2ENTRY ~n := #in~n; 8246#L18 assume !(~n < 1); 8245#L20 assume !(1 == ~n); 8084#L23 call #t~ret2 := fibo1(~n - 1);< 8262#fibo1ENTRY ~n := #in~n; 8312#L8 assume !(~n < 1); 8313#L10 assume 1 == ~n;#res := 1; 8048#fibo1FINAL assume true; 8338#fibo1EXIT >#45#return; 8045#L23-1 call #t~ret3 := fibo1(~n - 2);< 8060#fibo1ENTRY ~n := #in~n; 8324#L8 assume ~n < 1;#res := 0; 8311#fibo1FINAL assume true; 8255#fibo1EXIT >#47#return; 8251#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8248#fibo2FINAL assume true; 8195#fibo2EXIT >#49#return; 8187#L13-1 call #t~ret1 := fibo2(~n - 2);< 8188#fibo2ENTRY ~n := #in~n; 8247#L18 assume ~n < 1;#res := 0; 8241#fibo2FINAL assume true; 8238#fibo2EXIT >#51#return; 8181#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8177#fibo1FINAL assume true; 8174#fibo1EXIT >#45#return; 8149#L23-1 call #t~ret3 := fibo1(~n - 2);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume !(1 == ~n); 8150#L23 call #t~ret2 := fibo1(~n - 1);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#45#return; 8192#L23-1 call #t~ret3 := fibo1(~n - 2);< 8197#fibo1ENTRY ~n := #in~n; 8225#L8 assume !(~n < 1); 8217#L10 assume !(1 == ~n); 8218#L13 call #t~ret0 := fibo2(~n - 1);< 8224#fibo2ENTRY ~n := #in~n; 8235#L18 assume !(~n < 1); 8233#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#47#return; 8193#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8189#fibo2FINAL assume true; 8144#fibo2EXIT >#49#return; 8129#L13-1 [2018-11-29 00:03:24,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 1 times [2018-11-29 00:03:24,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:24,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:24,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-29 00:03:24,802 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:24,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1570424754, now seen corresponding path program 1 times [2018-11-29 00:03:24,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-29 00:03:24,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:24,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:24,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-29 00:03:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-29 00:03:25,239 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:03:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:03:25,240 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. cyclomatic complexity: 116 Second operand 17 states. [2018-11-29 00:03:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:25,970 INFO L93 Difference]: Finished difference Result 418 states and 600 transitions. [2018-11-29 00:03:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-29 00:03:25,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 600 transitions. [2018-11-29 00:03:25,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:25,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 415 states and 596 transitions. [2018-11-29 00:03:25,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2018-11-29 00:03:25,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-11-29 00:03:25,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 596 transitions. [2018-11-29 00:03:25,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:25,989 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 596 transitions. [2018-11-29 00:03:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 596 transitions. [2018-11-29 00:03:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 393. [2018-11-29 00:03:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:03:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 558 transitions. [2018-11-29 00:03:26,010 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-11-29 00:03:26,010 INFO L608 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-11-29 00:03:26,010 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:03:26,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 558 transitions. [2018-11-29 00:03:26,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:26,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:26,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:26,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:26,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 10, 9, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1] [2018-11-29 00:03:26,020 INFO L794 eck$LassoCheckResult]: Stem: 9227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9189#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9190#fibo1ENTRY ~n := #in~n; 9381#L8 assume !(~n < 1); 9366#L10 assume !(1 == ~n); 9367#L13 call #t~ret0 := fibo2(~n - 1);< 9379#fibo2ENTRY ~n := #in~n; 9378#L18 assume !(~n < 1); 9377#L20 assume !(1 == ~n); 9214#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9239#L10 assume !(1 == ~n); 9213#L13 call #t~ret0 := fibo2(~n - 1);< 9215#fibo2ENTRY ~n := #in~n; 9235#L18 assume !(~n < 1); 9242#L20 assume !(1 == ~n); 9243#L23 call #t~ret2 := fibo1(~n - 1);< 9396#fibo1ENTRY ~n := #in~n; 9458#L8 assume !(~n < 1); 9457#L10 assume !(1 == ~n); 9187#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9373#L8 assume !(~n < 1); 9194#L10 assume !(1 == ~n); 9186#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9376#L8 assume !(~n < 1); 9482#L10 assume 1 == ~n;#res := 1; 9483#fibo1FINAL assume true; 9494#fibo1EXIT >#45#return; 9415#L23-1 call #t~ret3 := fibo1(~n - 2);< 9469#fibo1ENTRY ~n := #in~n; 9471#L8 assume ~n < 1;#res := 0; 9470#fibo1FINAL assume true; 9467#fibo1EXIT >#47#return; 9465#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9461#fibo2FINAL assume true; 9362#fibo2EXIT >#49#return; 9297#L13-1 [2018-11-29 00:03:26,021 INFO L796 eck$LassoCheckResult]: Loop: 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume !(1 == ~n); 9198#L13 call #t~ret0 := fibo2(~n - 1);< 9277#fibo2ENTRY ~n := #in~n; 9323#L18 assume !(~n < 1); 9320#L20 assume !(1 == ~n); 9256#L23 call #t~ret2 := fibo1(~n - 1);< 9274#fibo1ENTRY ~n := #in~n; 9272#L8 assume !(~n < 1); 9270#L10 assume 1 == ~n;#res := 1; 9271#fibo1FINAL assume true; 9326#fibo1EXIT >#45#return; 9203#L23-1 call #t~ret3 := fibo1(~n - 2);< 9204#fibo1ENTRY ~n := #in~n; 9329#L8 assume ~n < 1;#res := 0; 9273#fibo1FINAL assume true; 9310#fibo1EXIT >#47#return; 9206#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9197#fibo2FINAL assume true; 9200#fibo2EXIT >#49#return; 9220#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume 1 == ~n;#res := 1; 9446#fibo1FINAL assume true; 9486#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#51#return; 9361#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9523#fibo1FINAL assume true; 9392#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume 1 == ~n;#res := 1; 9372#fibo1FINAL assume true; 9487#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#49#return; 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9386#fibo2ENTRY ~n := #in~n; 9449#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9431#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9528#fibo1FINAL assume true; 9395#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9393#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9405#fibo2FINAL assume true; 9403#fibo2EXIT >#49#return; 9297#L13-1 [2018-11-29 00:03:26,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:26,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1138675049, now seen corresponding path program 2 times [2018-11-29 00:03:26,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:26,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:26,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:26,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:26,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:26,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-11-29 00:03:26,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:26,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1600037258, now seen corresponding path program 2 times [2018-11-29 00:03:26,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:26,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 56 proven. 91 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-29 00:03:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:26,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:26,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:26,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 302 proven. 29 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-29 00:03:26,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-11-29 00:03:26,852 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:26,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-29 00:03:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-29 00:03:26,853 INFO L87 Difference]: Start difference. First operand 393 states and 558 transitions. cyclomatic complexity: 169 Second operand 23 states. [2018-11-29 00:03:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:27,555 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2018-11-29 00:03:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-29 00:03:27,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 668 transitions. [2018-11-29 00:03:27,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:27,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 453 states and 591 transitions. [2018-11-29 00:03:27,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2018-11-29 00:03:27,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2018-11-29 00:03:27,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 591 transitions. [2018-11-29 00:03:27,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:27,574 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 591 transitions. [2018-11-29 00:03:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 591 transitions. [2018-11-29 00:03:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 427. [2018-11-29 00:03:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-11-29 00:03:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 550 transitions. [2018-11-29 00:03:27,590 INFO L728 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-11-29 00:03:27,590 INFO L608 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-11-29 00:03:27,590 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:27,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 550 transitions. [2018-11-29 00:03:27,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:27,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:27,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:27,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:27,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:27,597 INFO L794 eck$LassoCheckResult]: Stem: 10746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10714#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10715#fibo1ENTRY ~n := #in~n; 10842#L8 assume !(~n < 1); 10838#L10 assume !(1 == ~n); 10833#L13 call #t~ret0 := fibo2(~n - 1);< 10834#fibo2ENTRY ~n := #in~n; 10847#L18 assume !(~n < 1); 10846#L20 assume !(1 == ~n); 10844#L23 call #t~ret2 := fibo1(~n - 1);< 10845#fibo1ENTRY ~n := #in~n; 10858#L8 assume !(~n < 1); 10857#L10 assume !(1 == ~n); 10855#L13 call #t~ret0 := fibo2(~n - 1);< 10856#fibo2ENTRY ~n := #in~n; 10871#L18 assume !(~n < 1); 10870#L20 assume !(1 == ~n); 10868#L23 call #t~ret2 := fibo1(~n - 1);< 10869#fibo1ENTRY ~n := #in~n; 10981#L8 assume !(~n < 1); 10979#L10 assume !(1 == ~n); 10975#L13 call #t~ret0 := fibo2(~n - 1);< 10977#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(1 == ~n); 10992#L23 call #t~ret2 := fibo1(~n - 1);< 10993#fibo1ENTRY ~n := #in~n; 11053#L8 assume !(~n < 1); 11050#L10 assume !(1 == ~n); 11008#L13 call #t~ret0 := fibo2(~n - 1);< 11009#fibo2ENTRY ~n := #in~n; 11014#L18 assume !(~n < 1); 11013#L20 assume 1 == ~n;#res := 1; 11012#fibo2FINAL assume true; 11007#fibo2EXIT >#49#return; 11001#L13-1 call #t~ret1 := fibo2(~n - 2);< 11002#fibo2ENTRY ~n := #in~n; 11025#L18 assume ~n < 1;#res := 0; 11024#fibo2FINAL assume true; 11000#fibo2EXIT >#51#return; 10998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10997#fibo1FINAL assume true; 10991#fibo1EXIT >#45#return; 10926#L23-1 call #t~ret3 := fibo1(~n - 2);< 10988#fibo1ENTRY ~n := #in~n; 11027#L8 assume ~n < 1;#res := 0; 11026#fibo1FINAL assume true; 10986#fibo1EXIT >#47#return; 10985#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10984#fibo2FINAL assume true; 10976#fibo2EXIT >#49#return; 10918#L13-1 call #t~ret1 := fibo2(~n - 2);< 10931#fibo2ENTRY ~n := #in~n; 10932#L18 assume ~n < 1;#res := 0; 10925#fibo2FINAL assume true; 10914#fibo2EXIT >#51#return; 10921#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11058#fibo1FINAL assume true; 10867#fibo1EXIT >#45#return; 10862#L23-1 call #t~ret3 := fibo1(~n - 2);< 10866#fibo1ENTRY ~n := #in~n; 10996#L8 assume !(~n < 1); 10994#L10 assume !(1 == ~n); 10957#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-11-29 00:03:27,597 INFO L796 eck$LassoCheckResult]: Loop: 10990#fibo2ENTRY ~n := #in~n; 11054#L18 assume !(~n < 1); 11051#L20 assume !(1 == ~n); 10929#L23 call #t~ret2 := fibo1(~n - 1);< 11017#fibo1ENTRY ~n := #in~n; 11057#L8 assume !(~n < 1); 11055#L10 assume !(1 == ~n); 10956#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-11-29 00:03:27,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1911557610, now seen corresponding path program 1 times [2018-11-29 00:03:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-29 00:03:27,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:27,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 30 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-29 00:03:28,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:28,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 21 [2018-11-29 00:03:28,105 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:28,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1606542952, now seen corresponding path program 2 times [2018-11-29 00:03:28,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:28,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:28,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:28,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:28,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:28,200 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:28,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:28,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:28,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:28,201 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:28,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:28,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:28,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:03:28,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:28,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:28,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:28,400 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,430 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,433 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,434 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,456 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,482 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,506 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,506 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,530 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,530 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,552 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,560 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,605 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:28,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,647 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:28,649 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:28,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:28,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:28,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:28,650 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:28,650 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:28,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:28,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:03:28,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:28,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:28,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:28,726 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:28,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:28,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:28,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:28,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:28,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:28,786 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:28,787 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:28,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-29 00:03:28,794 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:29,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,418 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:03:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:29,653 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 [2018-11-29 00:03:29,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:29,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-11-29 00:03:29,762 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 [2018-11-29 00:03:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-29 00:03:29,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:29,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:29,763 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:29,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:30,083 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 [2018-11-29 00:03:30,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:30,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-11-29 00:03:30,214 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 [2018-11-29 00:03:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-29 00:03:30,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:30,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:30,217 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:30,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:30,885 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 [2018-11-29 00:03:30,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:31,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 739 states and 924 transitions. Complement of second has 27 states. [2018-11-29 00:03:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-29 00:03:31,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:31,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 72 letters. Loop has 8 letters. [2018-11-29 00:03:31,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 16 letters. [2018-11-29 00:03:31,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 739 states and 924 transitions. [2018-11-29 00:03:31,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 739 states to 0 states and 0 transitions. [2018-11-29 00:03:31,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:31,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:31,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:31,624 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,624 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-29 00:03:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-11-29 00:03:31,625 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 21 states. [2018-11-29 00:03:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:31,628 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:31,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:31,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:31,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:31,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:31,629 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,629 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,629 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,629 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:31,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:31,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:31 BoogieIcfgContainer [2018-11-29 00:03:31,647 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:31,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:31,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:31,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:31,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/4) ... [2018-11-29 00:03:31,658 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:31,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:31,659 INFO L168 Benchmark]: Toolchain (without parser) took 26122.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -297.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,660 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-11-29 00:03:31,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2018-11-29 00:03:31,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.09 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. [2018-11-29 00:03:31,665 INFO L168 Benchmark]: Boogie Preprocessor took 37.48 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. [2018-11-29 00:03:31,665 INFO L168 Benchmark]: RCFGBuilder took 622.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,668 INFO L168 Benchmark]: BuchiAutomizer took 25039.35 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -182.2 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,668 INFO L168 Benchmark]: Witness Printer took 10.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,674 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.18 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 355.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 51.09 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 37.48 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 622.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25039.35 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -182.2 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * Witness Printer took 10.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.9s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 11.1s. Construction of modules took 3.9s. Büchi inclusion checks took 9.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 427 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 305 SDtfs, 775 SDslu, 899 SDs, 0 SdLazy, 2034 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...