./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_false-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_5_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:34:17,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:34:17,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:34:17,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:34:17,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:34:17,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:34:17,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:34:17,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:34:17,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:34:17,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:34:17,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:34:17,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:34:17,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:34:17,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:34:17,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:34:17,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:34:17,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:34:17,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:34:17,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:34:17,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:34:17,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:34:17,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:34:17,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:34:17,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:34:17,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:34:17,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:34:17,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:34:17,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:34:17,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:34:17,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:34:17,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:34:17,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:34:17,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:34:17,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:34:17,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:34:17,759 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:17,781 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:34:17,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:34:17,783 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:34:17,784 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:34:17,784 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:34:17,785 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:34:17,785 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:34:17,785 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:34:17,785 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:34:17,785 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:34:17,786 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:34:17,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:34:17,786 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:34:17,786 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:34:17,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:34:17,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:34:17,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:34:17,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:34:17,789 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:34:17,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:34:17,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:34:17,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:34:17,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:34:17,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:34:17,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:34:17,792 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:34:17,795 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:34:17,795 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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2019-01-14 04:34:17,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:34:17,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:34:17,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:34:17,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:34:17,878 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:34:17,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-14 04:34:17,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f950faa/083734098a0c43c382a035338793e368/FLAG3746b76cd [2019-01-14 04:34:18,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:34:18,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-14 04:34:18,504 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f950faa/083734098a0c43c382a035338793e368/FLAG3746b76cd [2019-01-14 04:34:18,865 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f950faa/083734098a0c43c382a035338793e368 [2019-01-14 04:34:18,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:34:18,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:34:18,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:18,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:34:18,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:34:18,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:18" (1/1) ... [2019-01-14 04:34:18,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436a47b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:18, skipping insertion in model container [2019-01-14 04:34:18,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:18" (1/1) ... [2019-01-14 04:34:18,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:34:18,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:34:19,211 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:19,219 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:34:19,249 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:19,275 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:34:19,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:19 WrapperNode [2019-01-14 04:34:19,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:19,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:19,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:34:19,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:34:19,296 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:19" (1/1) ... [2019-01-14 04:34:19,306 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:19" (1/1) ... [2019-01-14 04:34:19,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:19,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:34:19,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:34:19,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:34:19,363 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:19" (1/1) ... [2019-01-14 04:34:19,363 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:19" (1/1) ... [2019-01-14 04:34:19,364 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:19" (1/1) ... [2019-01-14 04:34:19,365 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:19" (1/1) ... [2019-01-14 04:34:19,368 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:19" (1/1) ... [2019-01-14 04:34:19,375 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:19" (1/1) ... [2019-01-14 04:34:19,377 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:19" (1/1) ... [2019-01-14 04:34:19,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:34:19,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:34:19,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:34:19,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:34:19,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:19" (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:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:34:19,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:34:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:34:19,560 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:34:19,816 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:34:19,816 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:34:19,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:19 BoogieIcfgContainer [2019-01-14 04:34:19,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:34:19,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:34:19,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:34:19,825 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:34:19,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:19,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:34:18" (1/3) ... [2019-01-14 04:34:19,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65d33998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:19, skipping insertion in model container [2019-01-14 04:34:19,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:19,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:19" (2/3) ... [2019-01-14 04:34:19,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65d33998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:19, skipping insertion in model container [2019-01-14 04:34:19,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:19,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:19" (3/3) ... [2019-01-14 04:34:19,832 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2019-01-14 04:34:19,969 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:34:19,972 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:34:19,976 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:34:19,976 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:34:19,978 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:34:19,978 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:34:19,978 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:34:19,978 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:34:19,979 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:34:20,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:20,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:20,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:20,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:20,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:20,159 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:20,159 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:34:20,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:20,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:20,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:20,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:20,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:20,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:20,182 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:34:20,182 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:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:34:20,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:34:20,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:20,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:20,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:34:20,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:20,615 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:20,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:20,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:20,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:20,618 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:20,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:20,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:20,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:20,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:20,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:20,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:20,650 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:20,683 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:20,712 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:20,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:20,734 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:20,921 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:34:21,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:21,031 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:21,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:21,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:21,077 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:21,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,130 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:21,148 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:21,149 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:21,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:21,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:21,194 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:21,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:21,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:21,226 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:21,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,254 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:21,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:21,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:21,353 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:21,364 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:21,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:21,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:21,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:21,365 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:21,365 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:21,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:21,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:21,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:21,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:21,366 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:21,368 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:21,384 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:21,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:21,601 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:21,605 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:21,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:21,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:21,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:21,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:21,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:21,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:21,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:21,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:21,622 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:21,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:21,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:21,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:21,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:21,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:21,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:21,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:21,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:21,631 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:21,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:21,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:21,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:21,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:21,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:21,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:21,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:21,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:21,640 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:21,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:21,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:21,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:21,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:21,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:21,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:21,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:21,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:21,648 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:21,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:21,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:21,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:21,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:21,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:21,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:21,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:21,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:21,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:21,667 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:21,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:21,671 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:21,672 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:21,672 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:21,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:21,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:21,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:22,238 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:22,258 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:22,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:34:22,814 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:22,817 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:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:34:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:34:22,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:34:22,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:22,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:34:22,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:22,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:34:22,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:22,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:34:22,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:22,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:34:22,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:34:22,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:34:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:34:22,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:22,862 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:34:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:34:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:34:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:34:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:34:22,913 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:22,913 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:22,913 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:34:22,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:34:22,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:22,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:22,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:22,920 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:22,920 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:22,921 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 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:22,921 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:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:34:22,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:22,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,116 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:23,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:23,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:34:23,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,275 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2019-01-14 04:34:23,431 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-14 04:34:23,638 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:23,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:23,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:23,640 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:34:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:34:23,652 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:34:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:23,914 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:34:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:34:23,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:34:23,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:34:23,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:34:23,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:34:23,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:34:23,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:23,928 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:34:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:34:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:34:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:34:23,935 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:23,935 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:23,935 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:34:23,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:34:23,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:23,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:23,938 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:23,938 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:23,938 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 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:23,939 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:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:34:23,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,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:24,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:24,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:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:24,058 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:24,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:24,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:34:24,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:34:24,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:24,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:24,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:24,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:24,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:24,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:24,331 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:24,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:24,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:24,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:24,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:24,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:24,334 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,343 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,359 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,369 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,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:24,491 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:24,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:24,496 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:24,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:24,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:25,282 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:25,285 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:25,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:25,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:25,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:25,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:25,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:25,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:25,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:25,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:25,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:25,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:25,290 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:25,297 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:25,337 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:25,340 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:25,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:25,461 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:25,461 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:25,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:25,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:25,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:25,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:25,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:25,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:25,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:25,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:25,471 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:25,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:25,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:25,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:25,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:25,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:25,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:25,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:25,485 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:25,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:25,496 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:25,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:25,497 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:25,497 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:25,497 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:25,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:25,755 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:25,755 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:25,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:34:26,112 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:26,114 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:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:26,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:34:26,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:34:26,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:34:26,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:34:26,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:26,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:34:26,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:34:26,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:26,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:34:26,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,145 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:34:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:34:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:34:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:34:26,166 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:34:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:34:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:34:26,167 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:34:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:26,326 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:34:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:34:26,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:34:26,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:26,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:34:26,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:34:26,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:26,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:34:26,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,342 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:34:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:34:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:34:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:34:26,357 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:26,357 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:26,357 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:34:26,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:34:26,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:26,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:26,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:26,362 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,362 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:26,363 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 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~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:34:26,363 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:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:34:26,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:26,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:26,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,488 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:26,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:26,489 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:26,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:26,548 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:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:26,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:34:26,587 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:26,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:34:26,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:26,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:26,815 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:26,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:26,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:26,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:26,815 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:26,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:26,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:26,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:26,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:26,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:26,817 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:26,818 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:26,852 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:26,857 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:26,861 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:26,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:26,954 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:26,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:26,958 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:26,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:26,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:27,735 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:27,739 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:27,739 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:27,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:27,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:27,740 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:27,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:27,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:27,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:27,740 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:27,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:27,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:27,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,760 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,872 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:27,873 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:27,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:27,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:27,891 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:27,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:27,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:27,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:27,905 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:27,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:27,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:27,942 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:27,943 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:27,943 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:27,943 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:27,943 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:27,946 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,159 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,161 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,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:28,438 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:28,441 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,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:28,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:28,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:28,443 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,684 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,686 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:28,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:28,917 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:28,924 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,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:34:28,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:28,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:28,926 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,315 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:29,316 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:29,317 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,039 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:30,048 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,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:34:30,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:30,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:34:30,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:34:30,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:34:30,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:30,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:34:30,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:34:30,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:34:30,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:34:30,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:30,108 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:34:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:34:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:34:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:34:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:34:30,174 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:34:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:30,175 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:34:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:31,030 INFO L93 Difference]: Finished difference Result 497 states and 787 transitions. [2019-01-14 04:34:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:31,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 787 transitions. [2019-01-14 04:34:31,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:31,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 784 transitions. [2019-01-14 04:34:31,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:34:31,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:34:31,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 784 transitions. [2019-01-14 04:34:31,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:31,068 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 784 transitions. [2019-01-14 04:34:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 784 transitions. [2019-01-14 04:34:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 365. [2019-01-14 04:34:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-14 04:34:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 517 transitions. [2019-01-14 04:34:31,112 INFO L729 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-14 04:34:31,112 INFO L609 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-14 04:34:31,112 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:34:31,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 517 transitions. [2019-01-14 04:34:31,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:31,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:31,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:31,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:31,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:31,122 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3586#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3597#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3594#L6 assume !(~n < 1); 3595#L8 assume !(1 == ~n); 3555#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3591#L6 assume !(~n < 1); 3593#L8 assume !(1 == ~n); 3554#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3590#L6 assume !(~n < 1); 3553#L8 assume 1 == ~n;#res := 1; 3556#fiboFINAL assume true; 3672#fiboEXIT >#32#return; 3617#L11-1 call #t~ret1 := fibo(~n - 2);< 3618#fiboENTRY ~n := #in~n; 3739#L6 assume !(~n < 1); 3736#L8 assume !(1 == ~n); 3737#L11 call #t~ret0 := fibo(~n - 1);< 3749#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3863#L8 assume !(1 == ~n); 3666#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-14 04:34:31,124 INFO L796 eck$LassoCheckResult]: Loop: 3872#fiboENTRY ~n := #in~n; 3879#L6 assume !(~n < 1); 3878#L8 assume !(1 == ~n); 3667#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-14 04:34:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:34:31,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:31,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:31,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:31,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:31,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:31,347 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:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,523 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:31,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:31,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-01-14 04:34:31,547 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:31,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:34:31,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:31,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:31,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:31,607 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:31,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:31,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:31,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:31,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:31,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:31,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:31,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:31,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:31,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:31,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:31,611 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:31,617 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:31,625 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:31,629 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:31,631 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:31,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:31,694 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:31,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:31,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:31,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:31,703 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:31,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:31,732 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:31,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:31,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:31,808 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:31,810 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:31,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:31,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:31,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:31,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:31,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:31,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:31,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:31,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:31,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:31,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:31,817 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:31,831 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:31,834 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:31,836 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:31,838 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:31,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:31,925 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:31,926 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:31,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:31,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:31,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:31,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:31,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:31,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:31,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:31,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:31,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:31,948 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:31,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:31,949 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:31,949 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:31,949 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:31,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,119 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:32,120 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:32,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:32,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-14 04:34:32,228 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:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:32,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:32,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,232 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:32,407 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:32,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:32,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-14 04:34:32,666 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:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:32,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:32,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,861 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:32,862 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:32,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:33,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 492 states and 654 transitions. Complement of second has 14 states. [2019-01-14 04:34:33,026 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:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:34:33,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:33,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:34:33,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:34:33,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 654 transitions. [2019-01-14 04:34:33,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:33,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 405 states and 565 transitions. [2019-01-14 04:34:33,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-14 04:34:33,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2019-01-14 04:34:33,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 565 transitions. [2019-01-14 04:34:33,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:33,062 INFO L706 BuchiCegarLoop]: Abstraction has 405 states and 565 transitions. [2019-01-14 04:34:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 565 transitions. [2019-01-14 04:34:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 389. [2019-01-14 04:34:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-14 04:34:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 541 transitions. [2019-01-14 04:34:33,107 INFO L729 BuchiCegarLoop]: Abstraction has 389 states and 541 transitions. [2019-01-14 04:34:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:34:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:34:33,111 INFO L87 Difference]: Start difference. First operand 389 states and 541 transitions. Second operand 20 states. [2019-01-14 04:34:33,994 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-14 04:34:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:34,715 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2019-01-14 04:34:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:34:34,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2019-01-14 04:34:34,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:34,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2019-01-14 04:34:34,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:34,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:34,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:34,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:34,721 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,721 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,721 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,722 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:34,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:34,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:34,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:34,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:34 BoogieIcfgContainer [2019-01-14 04:34:34,736 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:34,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:34,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:34,737 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:34,739 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:19" (3/4) ... [2019-01-14 04:34:34,746 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:34,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:34,748 INFO L168 Benchmark]: Toolchain (without parser) took 15877.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.4 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -302.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,750 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:34,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,752 INFO L168 Benchmark]: Boogie Preprocessor took 34.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,752 INFO L168 Benchmark]: RCFGBuilder took 438.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,753 INFO L168 Benchmark]: BuchiAutomizer took 14916.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,758 INFO L168 Benchmark]: Witness Printer took 9.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,765 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 404.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.22 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 438.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14916.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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 8 terminating modules (4 trivial, 2 deterministic, 2 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. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 6.2s. Construction of modules took 2.2s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 365 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 149 SDtfs, 379 SDslu, 185 SDs, 0 SdLazy, 716 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...