./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd6d4490a7412402195d3193de0347508566f7c8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:54:57,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:54:57,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:54:57,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:54:57,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:54:57,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:54:57,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:54:57,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:54:57,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:54:57,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:54:57,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:54:57,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:54:57,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:54:57,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:54:57,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:54:57,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:54:57,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:54:57,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:54:57,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:54:57,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:54:57,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:54:57,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:54:57,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:54:57,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:54:57,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:54:57,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:54:57,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:54:57,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:54:57,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:54:57,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:54:57,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:54:57,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:54:57,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:54:57,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:54:57,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:54:57,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:54:57,621 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:54:57,638 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:54:57,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:54:57,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:54:57,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:54:57,639 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:54:57,640 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:54:57,640 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:54:57,640 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:54:57,640 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:54:57,640 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:54:57,641 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:54:57,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:54:57,641 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:54:57,641 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:54:57,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:54:57,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:54:57,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:54:57,643 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:54:57,643 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:54:57,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:54:57,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:54:57,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:54:57,643 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:54:57,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:54:57,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:54:57,644 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:54:57,645 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:54:57,645 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 -> cd6d4490a7412402195d3193de0347508566f7c8 [2019-01-01 23:54:57,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:54:57,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:54:57,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:54:57,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:54:57,711 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:54:57,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2019-01-01 23:54:57,781 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e45c15/24ee918ad9dc4cc89c369540ffef1d5f/FLAGa95d26bc1 [2019-01-01 23:54:58,264 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:54:58,265 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2019-01-01 23:54:58,274 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e45c15/24ee918ad9dc4cc89c369540ffef1d5f/FLAGa95d26bc1 [2019-01-01 23:54:58,578 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e45c15/24ee918ad9dc4cc89c369540ffef1d5f [2019-01-01 23:54:58,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:54:58,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:54:58,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:58,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:54:58,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:54:58,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:58,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf8cf00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58, skipping insertion in model container [2019-01-01 23:54:58,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:58,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:54:58,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:54:58,903 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:58,908 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:54:58,928 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:58,946 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:54:58,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58 WrapperNode [2019-01-01 23:54:58,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:58,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:58,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:54:58,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:54:58,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:58,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:58,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:58,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:54:58,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:54:58,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:54:59,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... [2019-01-01 23:54:59,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:54:59,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:54:59,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:54:59,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:54:59,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:54:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:54:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-01 23:54:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-01 23:54:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-01 23:54:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-01 23:54:59,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:54:59,513 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:54:59,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:59 BoogieIcfgContainer [2019-01-01 23:54:59,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:54:59,515 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:54:59,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:54:59,519 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:54:59,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:59,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:54:58" (1/3) ... [2019-01-01 23:54:59,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a10d325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:59, skipping insertion in model container [2019-01-01 23:54:59,522 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:59,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:58" (2/3) ... [2019-01-01 23:54:59,523 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a10d325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:59, skipping insertion in model container [2019-01-01 23:54:59,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:59,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:59" (3/3) ... [2019-01-01 23:54:59,525 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_true-unreach-call_true-termination.c [2019-01-01 23:54:59,597 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:54:59,601 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:54:59,601 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:54:59,601 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:54:59,602 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:54:59,602 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:54:59,602 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:54:59,602 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:54:59,602 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:54:59,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:59,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:59,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:59,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:59,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:59,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:59,671 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:54:59,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:59,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:59,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:59,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:59,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:59,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:59,687 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-01-01 23:54:59,688 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-01-01 23:54:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-01-01 23:54:59,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:59,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-01-01 23:54:59,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:59,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-01-01 23:54:59,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:00,264 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 23:55:00,382 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:00,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:00,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:00,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:00,384 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:00,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:00,384 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:00,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:55:00,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:00,385 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:00,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,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-01 23:55:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:00,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:00,755 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-01 23:55:00,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:00,770 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,771 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:00,812 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,813 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:00,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,846 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:55:00,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,886 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,899 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:55:00,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,940 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,955 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,956 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:00,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:00,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:00,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:00,984 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:01,007 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:01,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:01,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:01,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:01,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:01,040 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:01,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:01,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:01,069 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:01,094 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:01,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:01,182 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:01,185 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:01,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:01,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:01,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:01,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:01,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:01,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:01,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:01,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:55:01,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:01,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:01,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-01 23:55:01,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,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-01 23:55:01,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:01,641 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-01 23:55:01,937 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:55:01,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:01,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:01,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:01,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:01,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:01,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:01,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:01,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:01,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:01,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:01,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:01,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:01,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:01,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:01,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:01,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:01,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:01,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:01,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:01,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:01,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:01,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:01,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:01,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:01,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:01,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:01,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:01,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:01,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:01,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:01,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:01,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:01,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:01,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:01,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:01,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:01,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:02,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:02,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:02,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:02,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:02,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:02,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:02,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:02,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:02,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:02,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:02,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:02,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:02,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:02,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:02,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:02,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:02,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:02,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:02,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:02,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:02,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:02,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:02,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:02,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:02,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:02,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:02,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:02,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:02,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:02,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:02,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:02,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:02,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:02,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:02,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:02,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:02,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:02,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:02,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:02,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:02,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:02,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:02,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:02,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:02,066 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:02,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:02,067 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-01-01 23:55:02,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:02,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:02,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:02,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:02,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 23:55:02,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-01-01 23:55:03,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2019-01-01 23:55:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:55:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-01-01 23:55:03,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 23:55:03,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:03,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 23:55:03,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:03,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 23:55:03,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:03,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-01-01 23:55:03,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:55:03,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-01-01 23:55:03,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 23:55:03,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-01 23:55:03,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-01-01 23:55:03,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:03,056 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-01-01 23:55:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-01-01 23:55:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-01-01 23:55:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 23:55:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-01-01 23:55:03,096 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:55:03,096 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:55:03,097 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:55:03,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-01-01 23:55:03,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:55:03,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:03,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:03,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,102 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-01-01 23:55:03,102 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-01-01 23:55:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-01-01 23:55:03,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:03,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:55:03,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:55:03,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-01-01 23:55:03,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:03,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:03,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:55:03,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:55:03,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:55:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:55:03,367 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-01-01 23:55:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:03,586 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-01-01 23:55:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:55:03,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-01-01 23:55:03,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:55:03,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-01-01 23:55:03,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-01 23:55:03,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 23:55:03,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-01-01 23:55:03,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:03,596 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-01-01 23:55:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-01-01 23:55:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-01 23:55:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 23:55:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-01-01 23:55:03,607 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:55:03,608 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:55:03,609 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:55:03,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-01-01 23:55:03,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:55:03,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:03,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:03,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,614 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2019-01-01 23:55:03,615 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2019-01-01 23:55:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-01-01 23:55:03,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:03,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:03,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:03,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:03,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:03,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:03,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 23:55:03,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-01-01 23:55:03,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:04,099 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:04,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:04,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:04,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:04,100 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:04,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:04,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:04,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:04,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:55:04,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:04,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:04,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:04,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:04,202 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:04,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:04,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:04,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:04,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:04,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:04,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:04,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:04,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:04,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:04,270 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:04,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:04,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:05,195 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:05,197 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:05,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:05,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:05,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:05,198 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:05,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:05,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:05,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:05,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:55:05,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:05,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:05,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,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-01 23:55:05,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:05,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:05,390 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:05,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:05,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:05,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:05,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:05,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:05,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:05,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:05,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:05,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:05,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:05,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:05,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:05,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:05,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:05,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:05,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:05,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:05,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:05,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:05,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:05,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:05,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:05,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:05,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:05,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:05,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:05,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:05,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:05,433 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:05,434 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:05,434 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:05,434 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:05,435 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-01 23:55:05,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:05,775 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:55:05,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-01-01 23:55:06,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2019-01-01 23:55:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-01-01 23:55:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-01-01 23:55:06,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-01-01 23:55:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-01-01 23:55:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:06,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-01-01 23:55:06,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:55:06,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-01-01 23:55:06,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-01 23:55:06,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-01 23:55:06,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-01-01 23:55:06,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:06,328 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-01-01 23:55:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-01-01 23:55:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-01-01 23:55:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-01 23:55:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-01-01 23:55:06,348 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-01-01 23:55:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:55:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:55:06,349 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2019-01-01 23:55:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:06,574 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-01-01 23:55:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:55:06,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-01-01 23:55:06,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:55:06,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-01-01 23:55:06,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-01 23:55:06,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-01 23:55:06,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-01-01 23:55:06,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:06,599 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-01-01 23:55:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-01-01 23:55:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-01-01 23:55:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-01 23:55:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-01-01 23:55:06,620 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:55:06,620 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:55:06,621 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:55:06,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-01-01 23:55:06,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:55:06,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:06,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:06,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 23:55:06,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 23:55:06,630 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:55:06,630 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:55:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-01-01 23:55:06,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:06,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-01-01 23:55:06,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:06,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:06,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:06,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-01 23:55:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:07,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2019-01-01 23:55:07,277 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-01-01 23:55:07,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-01 23:55:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:07,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:07,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:07,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 23:55:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 23:55:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 23:55:07,440 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:55:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:55:07,441 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-01-01 23:55:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:07,533 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-01-01 23:55:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:55:07,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-01-01 23:55:07,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:55:07,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-01-01 23:55:07,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-01 23:55:07,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-01 23:55:07,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-01-01 23:55:07,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:07,547 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-01-01 23:55:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-01-01 23:55:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-01-01 23:55:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 23:55:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-01-01 23:55:07,560 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:55:07,560 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:55:07,560 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:55:07,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-01-01 23:55:07,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:55:07,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:07,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:07,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-01 23:55:07,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:07,569 INFO L794 eck$LassoCheckResult]: Stem: 1915#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1878#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1884#fibo1ENTRY ~n := #in~n; 1921#L8 assume !(~n < 1); 1877#L10 assume !(1 == ~n); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1898#fibo2ENTRY ~n := #in~n; 1919#L18 assume !(~n < 1); 1992#L20 assume !(1 == ~n); 1903#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume 1 == ~n;#res := 1; 1872#fibo2FINAL assume true; 1873#fibo2EXIT >#49#return; 1868#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1925#L18 assume !(~n < 1); 1923#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1946#L8 assume !(~n < 1); 1953#L10 assume 1 == ~n;#res := 1; 1954#fibo1FINAL assume true; 1947#fibo1EXIT >#45#return; 1875#L23-1 call #t~ret3 := fibo1(~n - 2);< 1883#fibo1ENTRY ~n := #in~n; 1943#L8 assume !(~n < 1); 1940#L10 assume !(1 == ~n); 1882#L13 call #t~ret0 := fibo2(~n - 1);< 1936#fibo2ENTRY ~n := #in~n; 1934#L18 assume !(~n < 1); 1929#L20 assume 1 == ~n;#res := 1; 1930#fibo2FINAL assume true; 1920#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#45#return; 1975#L23-1 call #t~ret3 := fibo1(~n - 2);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#49#return; 1916#L13-1 [2019-01-01 23:55:07,569 INFO L796 eck$LassoCheckResult]: Loop: 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1977#L23 call #t~ret2 := fibo1(~n - 1);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 [2019-01-01 23:55:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-01-01 23:55:07,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:07,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-01-01 23:55:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:07,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:07,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:55:07,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:55:07,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:07,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-01 23:55:08,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:08,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2019-01-01 23:55:08,230 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2019-01-01 23:55:08,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:08,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:08,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:08,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:08,633 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 23:55:08,641 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:08,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:08,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:08,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:08,642 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:08,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:08,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:08,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:55:08,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:08,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:08,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:08,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:08,724 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,734 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,757 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,812 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,812 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,837 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:08,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:08,868 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:08,890 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:08,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:08,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:10,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:10,557 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:10,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:10,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:10,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:10,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:10,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:10,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:10,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:10,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:55:10,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:10,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:10,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:10,790 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:10,791 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:10,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:10,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:10,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:10,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:10,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:10,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:10,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:10,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:10,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:10,827 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:10,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:10,831 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:10,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:10,831 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:10,831 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:10,831 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-01 23:55:10,834 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:11,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:11,219 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:55:11,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:11,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2019-01-01 23:55:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2019-01-01 23:55:11,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:11,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:11,708 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:12,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:12,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:12,595 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:55:12,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:13,116 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2019-01-01 23:55:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2019-01-01 23:55:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:13,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:13,123 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:13,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:13,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:13,801 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 23:55:13,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:14,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2019-01-01 23:55:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2019-01-01 23:55:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:14,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:14,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2019-01-01 23:55:14,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:14,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2019-01-01 23:55:14,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:14,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2019-01-01 23:55:14,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2019-01-01 23:55:14,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2019-01-01 23:55:14,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-01-01 23:55:14,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2019-01-01 23:55:14,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2019-01-01 23:55:14,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:14,398 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2019-01-01 23:55:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2019-01-01 23:55:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2019-01-01 23:55:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-01-01 23:55:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2019-01-01 23:55:14,464 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2019-01-01 23:55:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 23:55:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-01-01 23:55:14,467 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2019-01-01 23:55:14,924 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 23:55:15,480 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:55:16,058 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 23:55:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:16,704 INFO L93 Difference]: Finished difference Result 416 states and 562 transitions. [2019-01-01 23:55:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 23:55:16,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 562 transitions. [2019-01-01 23:55:16,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:16,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 367 states and 504 transitions. [2019-01-01 23:55:16,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-01-01 23:55:16,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-01-01 23:55:16,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 504 transitions. [2019-01-01 23:55:16,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:16,723 INFO L705 BuchiCegarLoop]: Abstraction has 367 states and 504 transitions. [2019-01-01 23:55:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 504 transitions. [2019-01-01 23:55:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2019-01-01 23:55:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-01 23:55:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2019-01-01 23:55:16,741 INFO L728 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2019-01-01 23:55:16,741 INFO L608 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2019-01-01 23:55:16,741 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:55:16,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 444 transitions. [2019-01-01 23:55:16,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:16,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:16,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:16,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:16,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-01-01 23:55:16,754 INFO L794 eck$LassoCheckResult]: Stem: 8098#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8064#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8065#fibo1ENTRY ~n := #in~n; 8160#L8 assume !(~n < 1); 8155#L10 assume !(1 == ~n); 8135#L13 call #t~ret0 := fibo2(~n - 1);< 8152#fibo2ENTRY ~n := #in~n; 8169#L18 assume !(~n < 1); 8134#L20 assume !(1 == ~n); 8136#L23 call #t~ret2 := fibo1(~n - 1);< 8164#fibo1ENTRY ~n := #in~n; 8161#L8 assume !(~n < 1); 8156#L10 assume !(1 == ~n); 8035#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8162#L8 assume !(~n < 1); 8157#L10 assume !(1 == ~n); 8036#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8165#L8 assume !(~n < 1); 8296#L10 assume 1 == ~n;#res := 1; 8292#fibo1FINAL assume true; 8206#fibo1EXIT >#45#return; 8202#L23-1 call #t~ret3 := fibo1(~n - 2);< 8203#fibo1ENTRY ~n := #in~n; 8208#L8 assume ~n < 1;#res := 0; 8205#fibo1FINAL assume true; 8201#fibo1EXIT >#47#return; 8199#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8198#fibo2FINAL assume true; 8194#fibo2EXIT >#49#return; 8129#L13-1 [2019-01-01 23:55:16,755 INFO L796 eck$LassoCheckResult]: Loop: 8129#L13-1 call #t~ret1 := fibo2(~n - 2);< 8092#fibo2ENTRY ~n := #in~n; 8131#L18 assume !(~n < 1); 8130#L20 assume !(1 == ~n); 8091#L23 call #t~ret2 := fibo1(~n - 1);< 8126#fibo1ENTRY ~n := #in~n; 8125#L8 assume !(~n < 1); 8121#L10 assume !(1 == ~n); 8123#L13 call #t~ret0 := fibo2(~n - 1);< 8196#fibo2ENTRY ~n := #in~n; 8246#L18 assume !(~n < 1); 8245#L20 assume !(1 == ~n); 8084#L23 call #t~ret2 := fibo1(~n - 1);< 8262#fibo1ENTRY ~n := #in~n; 8312#L8 assume !(~n < 1); 8313#L10 assume 1 == ~n;#res := 1; 8048#fibo1FINAL assume true; 8338#fibo1EXIT >#45#return; 8045#L23-1 call #t~ret3 := fibo1(~n - 2);< 8060#fibo1ENTRY ~n := #in~n; 8324#L8 assume ~n < 1;#res := 0; 8311#fibo1FINAL assume true; 8255#fibo1EXIT >#47#return; 8251#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8248#fibo2FINAL assume true; 8195#fibo2EXIT >#49#return; 8187#L13-1 call #t~ret1 := fibo2(~n - 2);< 8188#fibo2ENTRY ~n := #in~n; 8247#L18 assume ~n < 1;#res := 0; 8241#fibo2FINAL assume true; 8238#fibo2EXIT >#51#return; 8181#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8177#fibo1FINAL assume true; 8174#fibo1EXIT >#45#return; 8149#L23-1 call #t~ret3 := fibo1(~n - 2);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume !(1 == ~n); 8150#L23 call #t~ret2 := fibo1(~n - 1);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#45#return; 8192#L23-1 call #t~ret3 := fibo1(~n - 2);< 8197#fibo1ENTRY ~n := #in~n; 8225#L8 assume !(~n < 1); 8217#L10 assume !(1 == ~n); 8218#L13 call #t~ret0 := fibo2(~n - 1);< 8224#fibo2ENTRY ~n := #in~n; 8235#L18 assume !(~n < 1); 8233#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#47#return; 8193#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8189#fibo2FINAL assume true; 8144#fibo2EXIT >#49#return; 8129#L13-1 [2019-01-01 23:55:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 1 times [2019-01-01 23:55:16,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:16,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:16,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:17,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:17,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:17,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:17,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:17,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:17,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 23:55:17,336 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1570424754, now seen corresponding path program 1 times [2019-01-01 23:55:17,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:17,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:17,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-01-01 23:55:17,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:17,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-01 23:55:17,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-01 23:55:17,777 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 23:55:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-01 23:55:17,778 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. cyclomatic complexity: 116 Second operand 17 states. [2019-01-01 23:55:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:18,536 INFO L93 Difference]: Finished difference Result 418 states and 600 transitions. [2019-01-01 23:55:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 23:55:18,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 600 transitions. [2019-01-01 23:55:18,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:18,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 415 states and 596 transitions. [2019-01-01 23:55:18,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2019-01-01 23:55:18,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2019-01-01 23:55:18,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 596 transitions. [2019-01-01 23:55:18,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:18,560 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 596 transitions. [2019-01-01 23:55:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 596 transitions. [2019-01-01 23:55:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 393. [2019-01-01 23:55:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-01 23:55:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 558 transitions. [2019-01-01 23:55:18,582 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2019-01-01 23:55:18,582 INFO L608 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2019-01-01 23:55:18,582 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:55:18,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 558 transitions. [2019-01-01 23:55:18,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-01 23:55:18,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:18,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:18,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:18,593 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 10, 9, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1] [2019-01-01 23:55:18,593 INFO L794 eck$LassoCheckResult]: Stem: 9227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9189#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9190#fibo1ENTRY ~n := #in~n; 9381#L8 assume !(~n < 1); 9366#L10 assume !(1 == ~n); 9367#L13 call #t~ret0 := fibo2(~n - 1);< 9379#fibo2ENTRY ~n := #in~n; 9378#L18 assume !(~n < 1); 9377#L20 assume !(1 == ~n); 9214#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9239#L10 assume !(1 == ~n); 9213#L13 call #t~ret0 := fibo2(~n - 1);< 9215#fibo2ENTRY ~n := #in~n; 9235#L18 assume !(~n < 1); 9242#L20 assume !(1 == ~n); 9243#L23 call #t~ret2 := fibo1(~n - 1);< 9396#fibo1ENTRY ~n := #in~n; 9458#L8 assume !(~n < 1); 9457#L10 assume !(1 == ~n); 9187#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9373#L8 assume !(~n < 1); 9194#L10 assume !(1 == ~n); 9186#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9376#L8 assume !(~n < 1); 9482#L10 assume 1 == ~n;#res := 1; 9483#fibo1FINAL assume true; 9494#fibo1EXIT >#45#return; 9415#L23-1 call #t~ret3 := fibo1(~n - 2);< 9469#fibo1ENTRY ~n := #in~n; 9471#L8 assume ~n < 1;#res := 0; 9470#fibo1FINAL assume true; 9467#fibo1EXIT >#47#return; 9465#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9461#fibo2FINAL assume true; 9362#fibo2EXIT >#49#return; 9297#L13-1 [2019-01-01 23:55:18,594 INFO L796 eck$LassoCheckResult]: Loop: 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume !(1 == ~n); 9198#L13 call #t~ret0 := fibo2(~n - 1);< 9277#fibo2ENTRY ~n := #in~n; 9323#L18 assume !(~n < 1); 9320#L20 assume !(1 == ~n); 9256#L23 call #t~ret2 := fibo1(~n - 1);< 9274#fibo1ENTRY ~n := #in~n; 9272#L8 assume !(~n < 1); 9270#L10 assume 1 == ~n;#res := 1; 9271#fibo1FINAL assume true; 9326#fibo1EXIT >#45#return; 9203#L23-1 call #t~ret3 := fibo1(~n - 2);< 9204#fibo1ENTRY ~n := #in~n; 9329#L8 assume ~n < 1;#res := 0; 9273#fibo1FINAL assume true; 9310#fibo1EXIT >#47#return; 9206#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9197#fibo2FINAL assume true; 9200#fibo2EXIT >#49#return; 9220#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume 1 == ~n;#res := 1; 9446#fibo1FINAL assume true; 9486#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#51#return; 9361#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9523#fibo1FINAL assume true; 9392#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume 1 == ~n;#res := 1; 9372#fibo1FINAL assume true; 9487#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#49#return; 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9386#fibo2ENTRY ~n := #in~n; 9449#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9431#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9528#fibo1FINAL assume true; 9395#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9393#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9405#fibo2FINAL assume true; 9403#fibo2EXIT >#49#return; 9297#L13-1 [2019-01-01 23:55:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1138675049, now seen corresponding path program 2 times [2019-01-01 23:55:18,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:18,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:18,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:18,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:18,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:18,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:55:18,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:55:18,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:18,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:19,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:19,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2019-01-01 23:55:19,050 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1600037258, now seen corresponding path program 2 times [2019-01-01 23:55:19,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:19,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:19,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 56 proven. 91 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-01-01 23:55:19,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:19,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:19,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:55:19,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:55:19,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:19,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 302 proven. 29 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-01-01 23:55:19,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:19,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2019-01-01 23:55:19,380 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 23:55:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-01-01 23:55:19,381 INFO L87 Difference]: Start difference. First operand 393 states and 558 transitions. cyclomatic complexity: 169 Second operand 23 states. [2019-01-01 23:55:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:20,112 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2019-01-01 23:55:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 23:55:20,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 668 transitions. [2019-01-01 23:55:20,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:55:20,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 453 states and 591 transitions. [2019-01-01 23:55:20,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2019-01-01 23:55:20,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2019-01-01 23:55:20,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 591 transitions. [2019-01-01 23:55:20,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:20,131 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 591 transitions. [2019-01-01 23:55:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 591 transitions. [2019-01-01 23:55:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 427. [2019-01-01 23:55:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 23:55:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 550 transitions. [2019-01-01 23:55:20,150 INFO L728 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2019-01-01 23:55:20,150 INFO L608 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2019-01-01 23:55:20,150 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:55:20,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 550 transitions. [2019-01-01 23:55:20,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:55:20,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:20,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:20,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:20,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:20,160 INFO L794 eck$LassoCheckResult]: Stem: 10746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10714#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10715#fibo1ENTRY ~n := #in~n; 10842#L8 assume !(~n < 1); 10838#L10 assume !(1 == ~n); 10833#L13 call #t~ret0 := fibo2(~n - 1);< 10834#fibo2ENTRY ~n := #in~n; 10847#L18 assume !(~n < 1); 10846#L20 assume !(1 == ~n); 10844#L23 call #t~ret2 := fibo1(~n - 1);< 10845#fibo1ENTRY ~n := #in~n; 10858#L8 assume !(~n < 1); 10857#L10 assume !(1 == ~n); 10855#L13 call #t~ret0 := fibo2(~n - 1);< 10856#fibo2ENTRY ~n := #in~n; 10871#L18 assume !(~n < 1); 10870#L20 assume !(1 == ~n); 10868#L23 call #t~ret2 := fibo1(~n - 1);< 10869#fibo1ENTRY ~n := #in~n; 10981#L8 assume !(~n < 1); 10979#L10 assume !(1 == ~n); 10975#L13 call #t~ret0 := fibo2(~n - 1);< 10977#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(1 == ~n); 10992#L23 call #t~ret2 := fibo1(~n - 1);< 10993#fibo1ENTRY ~n := #in~n; 11053#L8 assume !(~n < 1); 11050#L10 assume !(1 == ~n); 11008#L13 call #t~ret0 := fibo2(~n - 1);< 11009#fibo2ENTRY ~n := #in~n; 11014#L18 assume !(~n < 1); 11013#L20 assume 1 == ~n;#res := 1; 11012#fibo2FINAL assume true; 11007#fibo2EXIT >#49#return; 11001#L13-1 call #t~ret1 := fibo2(~n - 2);< 11002#fibo2ENTRY ~n := #in~n; 11025#L18 assume ~n < 1;#res := 0; 11024#fibo2FINAL assume true; 11000#fibo2EXIT >#51#return; 10998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10997#fibo1FINAL assume true; 10991#fibo1EXIT >#45#return; 10926#L23-1 call #t~ret3 := fibo1(~n - 2);< 10988#fibo1ENTRY ~n := #in~n; 11027#L8 assume ~n < 1;#res := 0; 11026#fibo1FINAL assume true; 10986#fibo1EXIT >#47#return; 10985#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10984#fibo2FINAL assume true; 10976#fibo2EXIT >#49#return; 10918#L13-1 call #t~ret1 := fibo2(~n - 2);< 10931#fibo2ENTRY ~n := #in~n; 10932#L18 assume ~n < 1;#res := 0; 10925#fibo2FINAL assume true; 10914#fibo2EXIT >#51#return; 10921#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11058#fibo1FINAL assume true; 10867#fibo1EXIT >#45#return; 10862#L23-1 call #t~ret3 := fibo1(~n - 2);< 10866#fibo1ENTRY ~n := #in~n; 10996#L8 assume !(~n < 1); 10994#L10 assume !(1 == ~n); 10957#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2019-01-01 23:55:20,160 INFO L796 eck$LassoCheckResult]: Loop: 10990#fibo2ENTRY ~n := #in~n; 11054#L18 assume !(~n < 1); 11051#L20 assume !(1 == ~n); 10929#L23 call #t~ret2 := fibo1(~n - 1);< 11017#fibo1ENTRY ~n := #in~n; 11057#L8 assume !(~n < 1); 11055#L10 assume !(1 == ~n); 10956#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2019-01-01 23:55:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1911557610, now seen corresponding path program 1 times [2019-01-01 23:55:20,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:20,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:55:20,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:20,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:20,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 30 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 23:55:20,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:20,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 21 [2019-01-01 23:55:20,536 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1606542952, now seen corresponding path program 2 times [2019-01-01 23:55:20,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:20,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:20,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:20,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:20,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:20,638 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:20,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:20,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:20,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:20,638 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:20,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:20,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:20,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2019-01-01 23:55:20,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:20,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:20,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-01 23:55:20,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,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-01 23:55:20,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,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-01 23:55:20,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:20,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:20,736 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,743 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,827 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,827 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,880 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:20,933 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:55:20,933 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:20,955 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:20,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:20,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:21,006 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:21,008 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:21,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:21,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:21,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:21,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:21,009 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:21,009 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:21,009 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:21,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2019-01-01 23:55:21,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:21,009 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:21,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:21,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:21,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:21,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:55:21,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:55:21,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:21,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:21,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:21,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:21,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:21,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:21,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:21,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:21,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:21,148 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:21,149 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:21,149 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:21,149 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:21,149 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2019-01-01 23:55:21,153 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:21,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:21,861 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:55:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:21,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:22,100 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:22,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2019-01-01 23:55:22,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2019-01-01 23:55:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-01 23:55:22,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-01 23:55:22,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:22,219 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:22,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:22,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:22,542 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:22,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2019-01-01 23:55:22,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2019-01-01 23:55:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-01 23:55:22,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-01 23:55:22,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:22,664 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:22,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:23,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:23,400 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 23:55:23,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2019-01-01 23:55:24,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 739 states and 924 transitions. Complement of second has 27 states. [2019-01-01 23:55:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:55:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2019-01-01 23:55:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-01 23:55:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 72 letters. Loop has 8 letters. [2019-01-01 23:55:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 16 letters. [2019-01-01 23:55:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:24,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 739 states and 924 transitions. [2019-01-01 23:55:24,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:24,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 739 states to 0 states and 0 transitions. [2019-01-01 23:55:24,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:55:24,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:55:24,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:55:24,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:55:24,149 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:24,150 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 23:55:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-01-01 23:55:24,150 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 21 states. [2019-01-01 23:55:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:24,150 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:55:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:55:24,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:55:24,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:24,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:55:24,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:55:24,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:55:24,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:55:24,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:55:24,152 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:24,152 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:24,152 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:24,152 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:55:24,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:55:24,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:24,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:55:24,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:55:24 BoogieIcfgContainer [2019-01-01 23:55:24,162 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:55:24,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:55:24,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:55:24,163 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:55:24,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:59" (3/4) ... [2019-01-01 23:55:24,168 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:55:24,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:55:24,169 INFO L168 Benchmark]: Toolchain (without parser) took 25587.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -333.6 MB). Peak memory consumption was 377.5 kB. Max. memory is 11.5 GB. [2019-01-01 23:55:24,171 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:24,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:24,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:24,173 INFO L168 Benchmark]: Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:24,175 INFO L168 Benchmark]: RCFGBuilder took 493.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:24,176 INFO L168 Benchmark]: BuchiAutomizer took 24647.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:24,176 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:24,186 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.21 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 360.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 493.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24647.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.5s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 11.4s. Construction of modules took 3.9s. Büchi inclusion checks took 8.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 427 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 305 SDtfs, 775 SDslu, 899 SDs, 0 SdLazy, 2034 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...