./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_7_true-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 f612eebc128d68e9b4bc81ed92184f640c3b9bd4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:34:21,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:34:21,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:34:21,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:34:21,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:34:21,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:34:21,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:34:21,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:34:21,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:34:21,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:34:21,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:34:21,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:34:21,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:34:21,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:34:21,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:34:21,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:34:21,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:34:21,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:34:21,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:34:21,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:34:21,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:34:21,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:34:21,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:34:21,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:34:21,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:34:21,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:34:21,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:34:21,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:34:21,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:34:21,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:34:21,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:34:21,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:34:21,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:34:21,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:34:21,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:34:21,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:34:21,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:34:21,858 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:34:21,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:34:21,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:34:21,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:34:21,861 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:34:21,862 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:34:21,862 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:34:21,862 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:34:21,862 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:34:21,862 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:34:21,863 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:34:21,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:34:21,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:34:21,865 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:34:21,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:34:21,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:34:21,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:34:21,866 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:34:21,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:34:21,866 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:34:21,868 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:34:21,869 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:34:21,869 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 -> f612eebc128d68e9b4bc81ed92184f640c3b9bd4 [2019-01-14 04:34:21,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:34:21,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:34:21,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:34:21,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:34:21,965 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:34:21,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2019-01-14 04:34:22,039 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7839ad8cb/9295d4103e094fe5914c7f720ca6bcb1/FLAGaa9697f70 [2019-01-14 04:34:22,473 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:34:22,473 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2019-01-14 04:34:22,480 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7839ad8cb/9295d4103e094fe5914c7f720ca6bcb1/FLAGaa9697f70 [2019-01-14 04:34:22,860 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7839ad8cb/9295d4103e094fe5914c7f720ca6bcb1 [2019-01-14 04:34:22,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:34:22,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:34:22,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:22,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:34:22,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:34:22,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:22" (1/1) ... [2019-01-14 04:34:22,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3694dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:22, skipping insertion in model container [2019-01-14 04:34:22,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:22" (1/1) ... [2019-01-14 04:34:22,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:34:22,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:34:23,118 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:23,128 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:34:23,147 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:23,167 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:34:23,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23 WrapperNode [2019-01-14 04:34:23,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:23,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:23,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:34:23,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:34:23,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:23,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:34:23,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:34:23,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:34:23,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... [2019-01-14 04:34:23,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:34:23,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:34:23,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:34:23,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:34:23,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:34:23,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:34:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:34:23,367 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:34:23,551 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:34:23,552 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:34:23,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:23 BoogieIcfgContainer [2019-01-14 04:34:23,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:34:23,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:34:23,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:34:23,559 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:34:23,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:23,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:34:22" (1/3) ... [2019-01-14 04:34:23,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5174b0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:23, skipping insertion in model container [2019-01-14 04:34:23,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:23,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:23" (2/3) ... [2019-01-14 04:34:23,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5174b0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:23, skipping insertion in model container [2019-01-14 04:34:23,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:23,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:23" (3/3) ... [2019-01-14 04:34:23,571 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_7_true-unreach-call_true-termination.c [2019-01-14 04:34:23,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:34:23,675 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:34:23,676 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:34:23,676 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:34:23,676 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:34:23,676 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:34:23,676 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:34:23,676 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:34:23,676 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:34:23,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:23,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:23,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:23,740 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:23,740 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:23,741 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:34:23,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:23,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:23,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:23,751 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:23,752 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:23,771 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:34:23,771 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-01-14 04:34:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:34:23,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:34:23,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:34:23,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:24,104 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:24,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:24,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:24,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:24,106 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:24,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:24,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:24,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:24,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:24,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:24,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,344 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:34:24,426 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:24,426 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:34:24,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,444 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:24,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:34:24,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,504 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:24,517 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:24,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:24,568 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:24,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:24,593 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,622 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:24,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:24,698 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:24,700 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:24,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:24,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:24,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:24,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:24,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:24,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:24,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:24,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:24,701 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:24,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:24,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:24,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:24,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:24,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:24,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:24,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:24,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:24,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:24,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:24,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:24,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:24,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:24,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:24,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:24,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:24,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:24,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:24,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:24,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:24,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:24,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:24,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:24,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:24,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:24,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:24,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:24,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:24,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:24,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:24,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:24,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:24,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:24,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:24,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:24,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:24,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:24,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:24,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:24,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:24,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:24,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:24,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:24,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:24,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:24,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:24,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:24,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:24,941 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:24,941 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:24,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:24,944 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:24,944 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:24,945 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:24,946 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:25,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:34:25,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:34:26,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-01-14 04:34:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:34:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:34:26,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:34:26,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:34:26,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:34:26,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:34:26,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:26,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:34:26,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:34:26,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:34:26,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:34:26,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,056 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:34:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:34:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:34:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:34:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:34:26,085 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:26,085 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:26,085 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:34:26,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:34:26,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:26,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:26,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:26,088 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,088 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,089 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:34:26,089 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:34:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:34:26,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:26,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:26,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:26,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:26,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:26,280 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:34:26,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:26,737 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:34:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:34:26,742 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:34:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:26,913 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:34:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:34:26,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:34:26,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:26,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:34:26,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:34:26,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:34:26,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:34:26,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,922 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:34:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:34:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:34:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:34:26,927 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:26,928 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:26,928 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:34:26,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:34:26,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:26,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:26,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:26,930 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,931 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,931 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:34:26,931 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:34:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:34:26,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:27,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:27,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:27,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:27,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:34:27,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:34:27,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:27,259 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:27,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:27,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:27,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:27,260 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:27,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:27,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:27,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:27,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:27,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:27,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:27,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,419 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:27,419 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:27,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:27,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:27,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:27,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:28,099 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:28,102 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:28,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:28,103 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:28,103 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:28,103 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:28,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:28,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:28,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:28,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:28,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:28,104 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:28,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,270 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:28,270 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:28,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:28,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:28,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:28,305 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:28,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:28,305 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:28,306 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:28,306 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:28,306 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:28,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 04:34:28,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:34:28,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-01-14 04:34:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:28,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:34:28,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:28,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:34:28,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:28,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:34:28,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:28,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:34:28,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:28,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:34:28,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:34:28,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:28,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:34:28,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:28,877 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:34:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:34:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:34:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:34:28,895 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:34:28,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:34:28,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:34:28,897 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:34:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:29,047 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:34:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:34:29,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:34:29,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:29,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:34:29,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:34:29,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:29,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:34:29,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:29,060 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:34:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:34:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:34:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:34:29,076 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:29,076 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:29,076 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:34:29,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:34:29,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:29,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:29,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:29,081 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:29,081 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:29,082 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:34:29,082 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:34:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,082 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:34:29,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:29,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:29,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:29,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:29,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:29,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:29,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:34:29,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:34:29,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:29,440 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:29,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:29,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:29,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:29,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:29,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:29,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:29,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:29,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:29,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:29,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:29,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,539 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:29,539 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:29,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:29,544 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:29,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:29,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:30,244 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:30,247 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:30,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:30,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:30,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:30,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:30,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:30,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:30,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:30,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:30,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:30,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:30,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:30,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:30,340 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:30,340 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:30,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:30,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:30,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:30,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:30,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:30,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:30,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:30,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:30,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:30,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:30,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:30,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:30,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:30,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:30,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:30,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:30,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:30,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:30,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:30,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:30,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:30,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:30,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:30,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:30,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:30,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:30,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:30,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:30,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:30,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:30,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:30,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:30,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:30,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:30,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:30,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:30,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:30,365 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:30,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:30,366 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:30,366 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:30,366 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:30,372 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:30,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:30,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:30,682 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 04:34:30,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:30,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2019-01-14 04:34:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:30,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:30,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,981 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:31,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 04:34:31,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:31,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2019-01-14 04:34:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:34:31,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:31,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:31,368 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,721 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-14 04:34:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:31,859 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 04:34:31,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:32,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2019-01-14 04:34:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:34:32,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:32,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:34:32,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:34:32,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:34:32,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:32,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:34:32,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:34:32,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:34:32,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:34:32,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:32,539 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:34:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:34:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:34:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:34:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:34:32,623 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:34:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:32,624 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:34:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:33,523 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-14 04:34:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:33,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-14 04:34:33,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:33,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-14 04:34:33,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:34:33,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:34:33,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-14 04:34:33,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:33,557 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-14 04:34:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-14 04:34:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-14 04:34:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-14 04:34:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-14 04:34:33,605 INFO L729 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:34:33,606 INFO L609 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:34:33,606 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:34:33,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-14 04:34:33,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:33,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:33,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:33,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:33,615 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:33,615 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:34:33,615 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:34:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:34:33,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:33,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 04:34:33,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:33,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:33,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:34:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-14 04:34:33,932 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:34:33,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:33,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:33,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:33,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:33,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:33,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:33,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:33,984 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:33,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:33,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:33,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:33,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:33,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:33,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:33,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,038 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:34,039 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:34,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:34,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:34,046 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:34,046 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:34,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:34,071 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:34,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:34,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:34,150 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:34,152 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:34,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:34,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:34,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:34,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:34,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:34,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:34,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:34,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:34,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:34,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:34,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:34,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:34,260 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:34,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:34,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:34,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:34,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:34,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:34,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:34,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:34,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:34,268 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:34,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:34,271 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:34,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:34,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:34,273 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:34,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:34,275 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:34,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:34:34,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:34,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-14 04:34:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:34,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:34,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:34,624 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:34,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:34:34,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:34,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-14 04:34:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:34,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:34,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:34,913 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:35,118 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-14 04:34:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:35,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:35,154 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:34:35,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:35,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2019-01-14 04:34:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:34:35,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:35,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:35,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:34:35,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:35,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:34:35,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:35,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-14 04:34:35,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:35,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-14 04:34:35,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-14 04:34:35,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-14 04:34:35,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-14 04:34:35,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:35,305 INFO L706 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-14 04:34:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-14 04:34:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-14 04:34:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:34:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-14 04:34:35,332 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-14 04:34:35,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:34:35,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:34:35,333 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-14 04:34:35,679 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:34:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:36,382 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-14 04:34:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:34:36,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-14 04:34:36,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:36,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-14 04:34:36,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:34:36,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:34:36,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-14 04:34:36,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:36,395 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-14 04:34:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-14 04:34:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-14 04:34:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:34:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:34:36,408 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:36,408 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:36,409 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:36,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-14 04:34:36,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:36,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:36,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:36,416 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:36,416 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:36,417 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-14 04:34:36,417 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-14 04:34:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2019-01-14 04:34:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 04:34:36,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:36,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:34:36,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:34:36,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:36,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 04:34:36,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-14 04:34:36,862 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:36,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:36,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-01-14 04:34:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:36,940 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:36,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:36,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:36,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:36,940 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:36,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:36,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:36,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:36,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:34:36,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:36,941 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:36,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:36,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:37,104 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:34:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:37,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:37,560 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 04:34:37,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:37,665 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:37,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:37,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:37,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:37,679 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:37,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:37,702 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:37,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:37,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:45,369 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:45,372 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:45,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:45,373 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:45,373 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:45,373 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:45,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:45,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:45,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:45,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:34:45,374 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:45,374 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:45,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,443 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:45,444 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:45,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:45,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:45,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:45,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:45,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:45,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:45,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:45,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:45,454 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:45,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:45,458 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:45,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:45,458 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:45,459 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:45,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:45,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:45,699 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:45,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:45,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2019-01-14 04:34:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:45,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:45,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:45,789 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:46,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:46,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:46,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2019-01-14 04:34:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:46,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:46,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,211 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:46,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:46,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:46,499 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:46,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:46,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2019-01-14 04:34:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:46,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:46,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-14 04:34:46,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-14 04:34:46,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-14 04:34:46,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:46,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-14 04:34:46,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-14 04:34:46,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-14 04:34:46,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-14 04:34:46,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:46,715 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-14 04:34:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-14 04:34:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-14 04:34:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:34:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:34:46,726 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:34:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:34:46,728 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-14 04:34:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:47,299 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2019-01-14 04:34:47,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:34:47,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 473 transitions. [2019-01-14 04:34:47,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:47,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 315 states and 437 transitions. [2019-01-14 04:34:47,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-14 04:34:47,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:34:47,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 437 transitions. [2019-01-14 04:34:47,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:47,313 INFO L706 BuchiCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-01-14 04:34:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 437 transitions. [2019-01-14 04:34:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 270. [2019-01-14 04:34:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-14 04:34:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-01-14 04:34:47,328 INFO L729 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:47,328 INFO L609 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:47,328 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:34:47,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 364 transitions. [2019-01-14 04:34:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:47,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:47,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:47,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 8, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-14 04:34:47,335 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:47,336 INFO L794 eck$LassoCheckResult]: Stem: 8504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8505#L25 call main_#t~ret2 := fibo(main_~x~0);< 8542#fiboENTRY ~n := #in~n; 8601#L6 assume !(~n < 1); 8599#L8 assume !(1 == ~n); 8596#L11 call #t~ret0 := fibo(~n - 1);< 8597#fiboENTRY ~n := #in~n; 8612#L6 assume !(~n < 1); 8611#L8 assume !(1 == ~n); 8606#L11 call #t~ret0 := fibo(~n - 1);< 8610#fiboENTRY ~n := #in~n; 8614#L6 assume !(~n < 1); 8608#L8 assume !(1 == ~n); 8603#L11 call #t~ret0 := fibo(~n - 1);< 8607#fiboENTRY ~n := #in~n; 8635#L6 assume !(~n < 1); 8634#L8 assume !(1 == ~n); 8529#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8646#L6 assume !(~n < 1); 8645#L8 assume !(1 == ~n); 8530#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8646#L6 assume !(~n < 1); 8645#L8 assume !(1 == ~n); 8530#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8647#L6 assume !(~n < 1); 8696#L8 assume 1 == ~n;#res := 1; 8680#fiboFINAL assume true; 8677#fiboEXIT >#32#return; 8528#L11-1 call #t~ret1 := fibo(~n - 2);< 8531#fiboENTRY ~n := #in~n; 8673#L6 assume ~n < 1;#res := 0; 8672#fiboFINAL assume true; 8671#fiboEXIT >#34#return; 8669#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8668#fiboFINAL assume true; 8658#fiboEXIT >#32#return; 8654#L11-1 call #t~ret1 := fibo(~n - 2);< 8655#fiboENTRY ~n := #in~n; 8664#L6 assume !(~n < 1); 8662#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8653#fiboEXIT >#34#return; 8617#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8648#fiboFINAL assume true; 8622#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8624#fiboENTRY ~n := #in~n; 8555#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8539#L11 call #t~ret0 := fibo(~n - 1);< 8535#fiboENTRY ~n := #in~n; 8762#L6 assume !(~n < 1); 8763#L8 assume !(1 == ~n); 8557#L11 call #t~ret0 := fibo(~n - 1);< 8561#fiboENTRY ~n := #in~n; 8582#L6 assume !(~n < 1); 8580#L8 assume !(1 == ~n); 8558#L11 [2019-01-14 04:34:47,338 INFO L796 eck$LassoCheckResult]: Loop: 8558#L11 call #t~ret0 := fibo(~n - 1);< 8561#fiboENTRY ~n := #in~n; 8582#L6 assume !(~n < 1); 8580#L8 assume !(1 == ~n); 8558#L11 [2019-01-14 04:34:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash 272834295, now seen corresponding path program 3 times [2019-01-14 04:34:47,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:47,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-14 04:34:47,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:47,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:34:47,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 04:34:47,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:47,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-14 04:34:47,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:47,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 19 [2019-01-14 04:34:47,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-01-14 04:34:47,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:47,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:47,711 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:47,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:47,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:47,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:47,712 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:47,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:47,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:47,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:47,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:47,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:47,713 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:47,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:47,784 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:47,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:47,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:47,795 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:47,795 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:47,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:47,818 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:47,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:47,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:48,909 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:48,911 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:48,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:48,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:48,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:48,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:48,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:48,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:48,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:48,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:48,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:48,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:48,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:48,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:48,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:48,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:48,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:48,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:48,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:48,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:48,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:48,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:48,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:48,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:48,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:48,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:48,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:48,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:48,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:48,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:48,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:48,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:48,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:48,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:48,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:48,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:48,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:48,995 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:48,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:48,996 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:48,996 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:48,996 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:48,997 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:49,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:49,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:49,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 285 states and 380 transitions. Complement of second has 18 states. [2019-01-14 04:34:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:49,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:49,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:49,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:49,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 291 states and 386 transitions. Complement of second has 17 states. [2019-01-14 04:34:49,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:49,781 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:49,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:49,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 349 states and 462 transitions. Complement of second has 27 states. [2019-01-14 04:34:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:49,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:49,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:49,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 8 letters. [2019-01-14 04:34:49,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 462 transitions. [2019-01-14 04:34:49,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:49,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 274 states and 369 transitions. [2019-01-14 04:34:49,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2019-01-14 04:34:49,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:34:49,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 369 transitions. [2019-01-14 04:34:49,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:49,973 INFO L706 BuchiCegarLoop]: Abstraction has 274 states and 369 transitions. [2019-01-14 04:34:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 369 transitions. [2019-01-14 04:34:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2019-01-14 04:34:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-14 04:34:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-01-14 04:34:49,987 INFO L729 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 04:34:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-01-14 04:34:49,989 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 19 states. [2019-01-14 04:34:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:50,520 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2019-01-14 04:34:50,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:34:50,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 336 transitions. [2019-01-14 04:34:50,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:50,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:50,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:50,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:50,526 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:34:50,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:50,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:50,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:50,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:50 BoogieIcfgContainer [2019-01-14 04:34:50,538 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:50,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:50,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:50,539 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:50,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:23" (3/4) ... [2019-01-14 04:34:50,547 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:50,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:50,548 INFO L168 Benchmark]: Toolchain (without parser) took 27682.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -298.9 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,549 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. [2019-01-14 04:34:50,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.44 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,552 INFO L168 Benchmark]: Boogie Preprocessor took 21.21 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,552 INFO L168 Benchmark]: RCFGBuilder took 323.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,554 INFO L168 Benchmark]: BuchiAutomizer took 26984.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,556 INFO L168 Benchmark]: Witness Printer took 8.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,560 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 300.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 39.44 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.21 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26984.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.26 ms. Allocated memory is still 1.3 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 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.9s and 8 iterations. TraceHistogramMax:12. Analysis of lassos took 15.9s. Construction of modules took 3.2s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 342 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 239 SDtfs, 640 SDslu, 300 SDs, 0 SdLazy, 1132 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...