./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_10_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:35,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:35,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:35,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:35,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:35,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:35,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:35,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:35,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:35,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:35,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:35,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:35,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:35,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:35,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:35,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:35,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:35,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:35,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:35,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:35,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:35,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:35,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:35,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:35,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:35,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:35,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:35,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:35,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:35,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:35,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:35,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:35,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:35,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:35,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:35,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:35,309 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:33:35,332 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:35,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:35,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:35,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:35,338 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:35,338 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:35,338 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:35,338 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:35,338 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:35,339 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:35,339 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:35,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:35,339 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:35,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:35,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:35,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:35,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:35,343 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:35,344 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:35,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:35,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:35,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:35,344 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:35,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:35,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:35,347 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:35,348 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:35,349 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2019-01-14 04:33:35,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:35,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:35,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:35,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:35,430 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:35,431 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-14 04:33:35,505 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7029eabc/a7d31e3a7d974ea3859a8afba98a06e5/FLAG4e77e21ec [2019-01-14 04:33:35,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:35,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-14 04:33:35,978 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7029eabc/a7d31e3a7d974ea3859a8afba98a06e5/FLAG4e77e21ec [2019-01-14 04:33:36,357 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7029eabc/a7d31e3a7d974ea3859a8afba98a06e5 [2019-01-14 04:33:36,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:36,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:36,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:36,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:36,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:36,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36, skipping insertion in model container [2019-01-14 04:33:36,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:36,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:36,644 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:36,651 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:36,671 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:36,690 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:36,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36 WrapperNode [2019-01-14 04:33:36,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:36,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:36,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:36,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:36,705 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:33:36" (1/1) ... [2019-01-14 04:33:36,712 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:33:36" (1/1) ... [2019-01-14 04:33:36,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:36,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:36,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:36,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:36,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:36,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:36,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:36,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:36,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (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:33:36,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:36,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:36,893 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:33:36,893 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:33:37,078 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:37,079 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:37,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37 BoogieIcfgContainer [2019-01-14 04:33:37,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:37,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:37,082 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:37,086 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:37,088 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:36" (1/3) ... [2019-01-14 04:33:37,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af35438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:37, skipping insertion in model container [2019-01-14 04:33:37,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36" (2/3) ... [2019-01-14 04:33:37,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af35438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:37, skipping insertion in model container [2019-01-14 04:33:37,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37" (3/3) ... [2019-01-14 04:33:37,094 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2019-01-14 04:33:37,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:37,185 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:37,186 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:37,186 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:37,186 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:37,186 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:37,186 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:37,187 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:37,187 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:37,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:33:37,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:37,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:37,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:37,283 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:37,283 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:37,284 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:37,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:33:37,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:37,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:37,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:37,288 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:37,288 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:37,298 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:33:37,298 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:33:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:33:37,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:33:37,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:33:37,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,693 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:37,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:37,695 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:37,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:37,695 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:37,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:37,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:37,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:37,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:37,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:37,697 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:37,720 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:33:37,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:33:37,738 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:33:37,746 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:33:37,749 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:33:37,893 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:33:37,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:37,981 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:33:37,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:37,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,017 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:33:38,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,059 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:33:38,066 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,066 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:33:38,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,103 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:33:38,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,129 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,129 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:33:38,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,153 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:33:38,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:38,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,218 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:38,221 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:38,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:38,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:38,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:38,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:38,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:38,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:38,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:38,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:38,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:38,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:38,227 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:33:38,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:38,267 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:33:38,273 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:33:38,278 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:33:38,431 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:38,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:38,439 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:33:38,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,452 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:33:38,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,458 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:33:38,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,465 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:33:38,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,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:33:38,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:38,491 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:38,491 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:38,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:38,494 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:38,495 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:38,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:33:38,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:38,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:38,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:38,954 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:33:38,968 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:33:38,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:33:39,362 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:33:39,363 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:33:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:33:39,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:33:39,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:33:39,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:33:39,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:33:39,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:39,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:33:39,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:33:39,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:33:39,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:33:39,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:39,392 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:33:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:33:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:33:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:33:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:33:39,422 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:39,422 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:39,422 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:39,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:33:39,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:39,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:39,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:39,425 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:39,426 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:39,426 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:33:39,426 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:33:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:33:39,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:39,570 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:33:39,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:39,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:39,576 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:33:39,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:39,726 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2019-01-14 04:33:40,044 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:33:40,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:40,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:40,045 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:33:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:33:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:33:40,050 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:33:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:40,191 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:33:40,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:40,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:33:40,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:40,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:33:40,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:33:40,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:33:40,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:40,201 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:33:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:33:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:33:40,206 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,206 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,207 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:40,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:40,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:40,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:40,210 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:40,210 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:40,212 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:33:40,212 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:33:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:33:40,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,305 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:33:40,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:40,305 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:33:40,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:40,349 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:33:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:33:40,375 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:33:40,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:40,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:40,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:40,573 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:40,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:40,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:40,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:40,574 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:40,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:40,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:40,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:40,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:40,575 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:40,577 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:33:40,584 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:33:40,599 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:33:40,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:40,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:40,725 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:33:40,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,729 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:33:40,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:40,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:41,378 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:41,381 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:41,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:41,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:41,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:41,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:41,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:41,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:41,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:41,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:41,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:41,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:41,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:33:41,392 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:33:41,436 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:33:41,439 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:33:41,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:41,541 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:41,541 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:33:41,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:41,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:41,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:41,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:41,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:41,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:41,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:41,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:41,550 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:33:41,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:41,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:41,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:41,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:41,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:41,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:41,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:41,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:41,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:41,576 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:41,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:41,577 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:41,577 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:41,577 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:41,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:41,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:41,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:41,764 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:33:41,765 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:33:41,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:33:42,061 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:33:42,063 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:33:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:42,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:33:42,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:33:42,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:33:42,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:33:42,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:33:42,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:33:42,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:42,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:33:42,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:42,085 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:33:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:33:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:33:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:33:42,105 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:33:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:33:42,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:33:42,105 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:33:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:42,250 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:33:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:33:42,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:33:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:33:42,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:33:42,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:42,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:33:42,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:42,262 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:33:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:33:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:33:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:33:42,276 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:42,276 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:42,276 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:42,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:33:42,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:42,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:42,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:42,282 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:42,282 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:33:42,282 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:33:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:33:42,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,401 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:33:42,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:42,402 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:33:42,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:42,436 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:33:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:33:42,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:33:42,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:42,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:42,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:42,613 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:42,613 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:42,613 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:42,613 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:42,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:42,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:42,614 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:42,614 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:42,614 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:33:42,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:42,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:42,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:33:42,678 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:33:42,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:42,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:33:42,730 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:42,730 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:33:42,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:42,734 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:33:42,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:42,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:43,391 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:43,393 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:43,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:43,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:43,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:43,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:43,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:43,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:43,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:43,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:33:43,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:43,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:43,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:33:43,398 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:33:43,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:33:43,406 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:33:43,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:43,500 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:43,500 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:33:43,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:43,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:43,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:43,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:43,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:43,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:43,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:43,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:43,507 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:33:43,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:43,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:43,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:43,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:43,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:43,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:43,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:43,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:43,513 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:33:43,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:43,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:43,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:43,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:43,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:43,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:43,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:43,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:43,521 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:33:43,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:43,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:43,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:43,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:43,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:43,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:43,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:43,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:43,534 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:43,535 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:43,535 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:43,535 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:43,535 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:43,535 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:43,536 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:43,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:43,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:43,727 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:33:43,728 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:33:43,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:43,955 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:33:43,959 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:33:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:43,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:43,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:43,962 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,161 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:33:44,161 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:33:44,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:44,370 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:33:44,376 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:33:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:33:44,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:44,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:44,377 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,777 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:33:44,777 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:33:44,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:45,368 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:33:45,370 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:33:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:33:45,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:45,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:45,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:33:45,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:45,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:33:45,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:45,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:33:45,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:45,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:33:45,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:33:45,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:33:45,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:33:45,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:45,439 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:33:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:33:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:33:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:33:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:33:45,512 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:33:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:33:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:33:45,514 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:33:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:46,054 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-14 04:33:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:33:46,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-14 04:33:46,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:46,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-14 04:33:46,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:33:46,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:33:46,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-14 04:33:46,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:46,088 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-14 04:33:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-14 04:33:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-14 04:33:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-14 04:33:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-14 04:33:46,126 INFO L729 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:46,127 INFO L609 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:46,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:46,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-14 04:33:46,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:46,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:46,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:46,136 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:46,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:46,137 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:33:46,137 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:33:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:33:46,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:46,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 04:33:46,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:46,256 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:33:46,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:46,411 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:33:46,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-14 04:33:46,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:33:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:46,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:46,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:46,481 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:46,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:46,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:46,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:46,481 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:46,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:46,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:46,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:46,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:46,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:46,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:46,486 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:33:46,492 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:33:46,498 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:33:46,501 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:33:46,503 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:33:46,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:46,536 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:33:46,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:46,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:46,544 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:46,545 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:33:46,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:46,567 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:33:46,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:46,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:46,635 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:46,636 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:46,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:46,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:46,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:46,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:46,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:46,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:46,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:46,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:46,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:46,638 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:46,639 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:33:46,653 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:33:46,655 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:33:46,656 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:33:46,657 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:33:46,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:46,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:46,728 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:33:46,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,735 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:46,738 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:46,738 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:46,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:46,739 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:46,739 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:46,739 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:33:46,739 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:46,886 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:33:46,886 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:33:46,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:47,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-14 04:33:47,038 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:33:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:47,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:47,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,040 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,207 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:33:47,207 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:33:47,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:47,277 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2019-01-14 04:33:47,280 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:33:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:47,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:47,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,531 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:33:47,531 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:33:47,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:47,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2019-01-14 04:33:47,850 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:33:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:33:47,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:47,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:33:47,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:33:47,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-14 04:33:47,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:47,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-14 04:33:47,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-14 04:33:47,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-14 04:33:47,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-14 04:33:47,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:47,873 INFO L706 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-14 04:33:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-14 04:33:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-14 04:33:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:33:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-14 04:33:47,903 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-14 04:33:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:33:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:33:47,906 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-14 04:33:48,506 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:33:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:49,020 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-14 04:33:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:33:49,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-14 04:33:49,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:49,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-14 04:33:49,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:33:49,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:33:49,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-14 04:33:49,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:49,032 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-14 04:33:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-14 04:33:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-14 04:33:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:49,043 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:49,043 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:49,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:33:49,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-14 04:33:49,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:49,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:49,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:49,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:49,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:49,049 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-14 04:33:49,049 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-14 04:33:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2019-01-14 04:33:49,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:49,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 04:33:49,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:49,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:33:49,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:33:49,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:49,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 04:33:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-14 04:33:49,454 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-01-14 04:33:49,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:49,553 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:49,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:49,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:49,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:49,553 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:49,553 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:49,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:49,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:49,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:33:49,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:49,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:49,555 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:33:49,586 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:33:49,724 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:33:49,724 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:33:49,759 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:33:50,141 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 04:33:50,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:50,157 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:50,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:50,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:50,170 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:50,171 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:50,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:50,192 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:50,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:50,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:57,717 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:57,721 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:57,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:57,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:57,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:57,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:57,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:57,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:57,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:57,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:33:57,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:57,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:57,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,737 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:33:57,741 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:33:57,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:57,788 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:57,788 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:33:57,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:57,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:57,803 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:57,803 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:57,803 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:57,803 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:57,803 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:57,807 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:57,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:57,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:58,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:33:58,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:58,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2019-01-14 04:33:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:33:58,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:58,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:58,077 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,552 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:33:58,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:33:58,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:58,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2019-01-14 04:33:58,668 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:33:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:33:58,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:58,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:58,670 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,850 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:33:58,851 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:33:58,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:59,048 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2019-01-14 04:33:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:33:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-14 04:33:59,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-14 04:33:59,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-14 04:33:59,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:59,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-14 04:33:59,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-14 04:33:59,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-14 04:33:59,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-14 04:33:59,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:59,061 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-14 04:33:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-14 04:33:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-14 04:33:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:59,069 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:33:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:33:59,070 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-14 04:33:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:59,545 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2019-01-14 04:33:59,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:33:59,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2019-01-14 04:33:59,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:59,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2019-01-14 04:33:59,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-14 04:33:59,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:33:59,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2019-01-14 04:33:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:59,557 INFO L706 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2019-01-14 04:33:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2019-01-14 04:33:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2019-01-14 04:33:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:33:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:33:59,570 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:33:59,570 INFO L609 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:33:59,570 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:33:59,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2019-01-14 04:33:59,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:59,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:59,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:59,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-14 04:33:59,579 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:59,579 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-14 04:33:59,579 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-14 04:33:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2019-01-14 04:33:59,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:59,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:59,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:59,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 04:33:59,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:59,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:33:59,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 04:33:59,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:59,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 04:33:59,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:59,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 04:33:59,862 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-01-14 04:33:59,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:59,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:59,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:59,956 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:59,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:59,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:59,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:59,957 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:59,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:59,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:59,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:59,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:33:59,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:59,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:59,958 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:33:59,961 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:33:59,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:59,980 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:00,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:00,073 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:34:00,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:00,088 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:00,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:00,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:00,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:00,116 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:00,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:00,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:01,139 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:01,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:01,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:01,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:01,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:01,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:01,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:01,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:01,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:01,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:01,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:01,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:01,143 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:01,146 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:01,154 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:01,155 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:01,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:01,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:01,211 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:01,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:01,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:01,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:01,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:01,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:01,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:01,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:01,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:01,214 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:01,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:01,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:01,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:01,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:01,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:01,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:01,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:01,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:01,220 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:01,220 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:01,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:01,221 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:01,221 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:01,221 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:01,222 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:01,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:01,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:01,424 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:01,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:01,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:01,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2019-01-14 04:34:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:01,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:01,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:01,499 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:01,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:01,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:01,782 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:01,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:01,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:01,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2019-01-14 04:34:01,889 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:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:01,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:01,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:01,890 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,282 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:02,283 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:02,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:02,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2019-01-14 04:34:02,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:02,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:02,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-01-14 04:34:02,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-14 04:34:02,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2019-01-14 04:34:02,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:02,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2019-01-14 04:34:02,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-14 04:34:02,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2019-01-14 04:34:02,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2019-01-14 04:34:02,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:02,375 INFO L706 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2019-01-14 04:34:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2019-01-14 04:34:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2019-01-14 04:34:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:34:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:34:02,389 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:34:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 04:34:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 04:34:02,389 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2019-01-14 04:34:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:02,668 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2019-01-14 04:34:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 04:34:02,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2019-01-14 04:34:02,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:02,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2019-01-14 04:34:02,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2019-01-14 04:34:02,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2019-01-14 04:34:02,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2019-01-14 04:34:02,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:02,686 INFO L706 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2019-01-14 04:34:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2019-01-14 04:34:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2019-01-14 04:34:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 04:34:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-14 04:34:02,704 INFO L729 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:02,704 INFO L609 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:02,704 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:34:02,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2019-01-14 04:34:02,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:02,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:02,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:02,711 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2019-01-14 04:34:02,711 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:02,714 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-14 04:34:02,714 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-14 04:34:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2019-01-14 04:34:02,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:02,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:02,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:02,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-14 04:34:02,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:02,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:02,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:34:02,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:34:02,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:02,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-14 04:34:03,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:03,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2019-01-14 04:34:03,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2019-01-14 04:34:03,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:03,178 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:03,179 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:03,179 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:03,179 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:03,179 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:03,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:03,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:03,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2019-01-14 04:34:03,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:03,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:03,181 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:03,188 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:03,190 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:03,201 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:03,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:03,269 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:03,277 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:03,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:03,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:03,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:03,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:03,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:03,336 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:03,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:04,276 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:04,278 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:04,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:04,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:04,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:04,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:04,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:04,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:04,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:04,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2019-01-14 04:34:04,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:04,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:04,280 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:04,285 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:04,286 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:04,287 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:04,471 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:34:04,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:04,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:04,474 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:04,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:04,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:04,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:04,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:04,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:04,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:04,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:04,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:04,483 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:04,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:04,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:04,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:04,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:04,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:04,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:04,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:04,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:04,486 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:04,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:04,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:04,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:04,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:04,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:04,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:04,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:04,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:04,495 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:04,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:04,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:04,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:04,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:04,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:04,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:04,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:04,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:04,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:04,507 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:04,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:04,507 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:04,507 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:04,508 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:04,511 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:04,762 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:04,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:04,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:04,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2019-01-14 04:34:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:04,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:04,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:04,855 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,127 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:05,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:05,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:05,289 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2019-01-14 04:34:05,290 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:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:05,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:05,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:05,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,672 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:05,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:05,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:05,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2019-01-14 04:34:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:05,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:05,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:05,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2019-01-14 04:34:05,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:05,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2019-01-14 04:34:05,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:05,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2019-01-14 04:34:05,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:05,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2019-01-14 04:34:05,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-14 04:34:05,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2019-01-14 04:34:05,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2019-01-14 04:34:05,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:05,857 INFO L706 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2019-01-14 04:34:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-01-14 04:34:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 04:34:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-14 04:34:05,876 INFO L729 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 04:34:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-01-14 04:34:05,877 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2019-01-14 04:34:06,269 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:34:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:07,602 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2019-01-14 04:34:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 04:34:07,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2019-01-14 04:34:07,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:07,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2019-01-14 04:34:07,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-01-14 04:34:07,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-01-14 04:34:07,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2019-01-14 04:34:07,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:07,621 INFO L706 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2019-01-14 04:34:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2019-01-14 04:34:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2019-01-14 04:34:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-14 04:34:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-14 04:34:07,644 INFO L729 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:07,644 INFO L609 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:07,644 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:34:07,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2019-01-14 04:34:07,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:07,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:07,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:07,655 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1] [2019-01-14 04:34:07,655 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:07,657 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14905#fiboENTRY ~n := #in~n; 15099#L6 assume !(~n < 1); 15095#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15090#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(1 == ~n); 15059#L11 call #t~ret0 := fibo(~n - 1);< 15066#fiboENTRY ~n := #in~n; 15064#L6 assume !(~n < 1); 15062#L8 assume !(1 == ~n); 15054#L11 call #t~ret0 := fibo(~n - 1);< 15058#fiboENTRY ~n := #in~n; 15057#L6 assume !(~n < 1); 15055#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14979#L6 assume !(~n < 1); 14976#L8 assume !(1 == ~n); 14932#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14959#L6 assume !(~n < 1); 15218#L8 assume 1 == ~n;#res := 1; 15217#fiboFINAL assume true; 15216#fiboEXIT >#32#return; 15214#L11-1 call #t~ret1 := fibo(~n - 2);< 15215#fiboENTRY ~n := #in~n; 15227#L6 assume ~n < 1;#res := 0; 15224#fiboFINAL assume true; 15213#fiboEXIT >#34#return; 15211#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15209#fiboFINAL assume true; 15208#fiboEXIT >#32#return; 15044#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15234#L6 assume !(~n < 1); 15053#L8 assume 1 == ~n;#res := 1; 14924#fiboFINAL assume true; 15043#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#32#return; 14986#L11-1 call #t~ret1 := fibo(~n - 2);< 14988#fiboENTRY ~n := #in~n; 15056#L6 assume !(~n < 1); 15052#L8 assume !(1 == ~n); 15022#L11 call #t~ret0 := fibo(~n - 1);< 15228#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15047#L8 assume 1 == ~n;#res := 1; 15036#fiboFINAL assume true; 15019#fiboEXIT >#32#return; 14996#L11-1 call #t~ret1 := fibo(~n - 2);< 15001#fiboENTRY ~n := #in~n; 15035#L6 assume ~n < 1;#res := 0; 15018#fiboFINAL assume true; 14993#fiboEXIT >#34#return; 14992#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14990#fiboFINAL assume true; 14985#fiboEXIT >#34#return; 14980#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14950#fiboFINAL assume true; 14942#fiboEXIT >#32#return; 14923#L11-1 call #t~ret1 := fibo(~n - 2);< 14934#fiboENTRY ~n := #in~n; 14928#L6 assume !(~n < 1); 14922#L8 assume !(1 == ~n); 14925#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15195#L8 assume !(1 == ~n); 15189#L11 call #t~ret0 := fibo(~n - 1);< 15191#fiboENTRY ~n := #in~n; 15148#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15188#fiboEXIT >#32#return; 15181#L11-1 call #t~ret1 := fibo(~n - 2);< 15187#fiboENTRY ~n := #in~n; 15198#L6 assume ~n < 1;#res := 0; 15142#fiboFINAL assume true; 15179#fiboEXIT >#34#return; 15185#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15204#fiboFINAL assume true; 15203#fiboEXIT >#32#return; 15042#L11-1 call #t~ret1 := fibo(~n - 2);< 15045#fiboENTRY ~n := #in~n; 15232#L6 assume !(~n < 1); 15048#L8 assume 1 == ~n;#res := 1; 15038#fiboFINAL assume true; 15041#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#34#return; 14944#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15221#fiboFINAL assume true; 15013#fiboEXIT >#32#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 15146#L6 assume !(~n < 1); 14977#L8 assume !(1 == ~n); 14978#L11 call #t~ret0 := fibo(~n - 1);< 15024#fiboENTRY ~n := #in~n; 15229#L6 assume !(~n < 1); 15266#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2019-01-14 04:34:07,657 INFO L796 eck$LassoCheckResult]: Loop: 14883#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2019-01-14 04:34:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash 79280042, now seen corresponding path program 5 times [2019-01-14 04:34:07,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2019-01-14 04:34:07,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:07,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:07,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:07,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 477112511, now seen corresponding path program 6 times [2019-01-14 04:34:07,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:07,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-01-14 04:34:08,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:08,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:08,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 04:34:08,221 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-01-14 04:34:08,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:08,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-01-14 04:34:08,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2019-01-14 04:34:08,462 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:08,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:08,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:08,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:08,463 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:08,463 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:08,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:08,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:08,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:08,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:08,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:08,465 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:08,478 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:08,479 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:08,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:08,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:08,544 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:08,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:08,549 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:08,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:08,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:15,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:15,628 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:15,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:15,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:15,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:15,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:15,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:15,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:15,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:15,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:15,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:15,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:15,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:15,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:15,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:15,648 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:15,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:15,687 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:15,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:15,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:15,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:15,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:15,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:15,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:15,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:15,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:15,692 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:15,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:15,701 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:15,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:15,702 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:15,702 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:15,702 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:15,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:16,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:16,516 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-14 04:34:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:16,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:16,735 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:16,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:16,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:16,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2019-01-14 04:34:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:16,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-14 04:34:16,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:16,799 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,403 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:17,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:17,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:17,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2019-01-14 04:34:17,495 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:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:17,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-14 04:34:17,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:17,496 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:17,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,943 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:17,943 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 04:34:17,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:18,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2019-01-14 04:34:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 4 letters. [2019-01-14 04:34:18,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2019-01-14 04:34:18,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 8 letters. [2019-01-14 04:34:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:18,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2019-01-14 04:34:18,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:18,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2019-01-14 04:34:18,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2019-01-14 04:34:18,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-14 04:34:18,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2019-01-14 04:34:18,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:18,031 INFO L706 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2019-01-14 04:34:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2019-01-14 04:34:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2019-01-14 04:34:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-14 04:34:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-14 04:34:18,046 INFO L729 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 04:34:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-01-14 04:34:18,047 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 25 states. [2019-01-14 04:34:18,372 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:34:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:19,085 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2019-01-14 04:34:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 04:34:19,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 864 transitions. [2019-01-14 04:34:19,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:19,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 0 states and 0 transitions. [2019-01-14 04:34:19,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:19,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:19,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:19,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:19,100 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:19,101 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:19,101 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:19,104 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:34:19,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:19,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:19,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:19,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:19 BoogieIcfgContainer [2019-01-14 04:34:19,115 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:19,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:19,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:19,116 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:19,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37" (3/4) ... [2019-01-14 04:34:19,126 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:19,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:19,127 INFO L168 Benchmark]: Toolchain (without parser) took 42765.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 952.7 MB in the beginning and 879.0 MB in the end (delta: 73.7 MB). Peak memory consumption was 416.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:19,130 INFO L168 Benchmark]: CDTParser took 0.16 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:19,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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:19,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.23 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:19,133 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:19,133 INFO L168 Benchmark]: RCFGBuilder took 314.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:19,136 INFO L168 Benchmark]: BuchiAutomizer took 42033.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 211.0 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:19,137 INFO L168 Benchmark]: Witness Printer took 10.48 ms. Allocated memory is still 1.4 GB. Free memory is still 879.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:19,143 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.16 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 328.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 45.23 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 314.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42033.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 211.0 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. * Witness Printer took 10.48 ms. Allocated memory is still 1.4 GB. Free memory is still 879.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.9s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 25.3s. Construction of modules took 4.5s. Büchi inclusion checks took 11.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 330 SDtfs, 948 SDslu, 470 SDs, 0 SdLazy, 1976 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 18.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...