./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_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_6_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 595c6555624af5bbcf79585a20acb2500e3eeee8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:54:45,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:54:45,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:54:45,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:54:45,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:54:45,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:54:45,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:54:45,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:54:45,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:54:45,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:54:45,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:54:45,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:54:45,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:54:45,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:54:45,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:54:45,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:54:45,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:54:45,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:54:45,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:54:45,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:54:45,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:54:45,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:54:45,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:54:45,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:54:45,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:54:45,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:54:45,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:54:45,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:54:45,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:54:45,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:54:45,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:54:45,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:54:45,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:54:45,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:54:45,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:54:45,575 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:45,612 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:54:45,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:54:45,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:54:45,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:54:45,616 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:54:45,616 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:54:45,617 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:54:45,618 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:54:45,618 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:54:45,618 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:54:45,618 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:54:45,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:54:45,619 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:54:45,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:54:45,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:54:45,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:54:45,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:54:45,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:54:45,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:54:45,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:54:45,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:54:45,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:54:45,625 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:54:45,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:54:45,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:54:45,625 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:54:45,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:54:45,629 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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2019-01-01 23:54:45,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:54:45,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:54:45,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:54:45,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:54:45,727 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:54:45,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2019-01-01 23:54:45,790 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a070d318/d851ebd629b347d980fabdeabaf6b044/FLAGb7a2b87b4 [2019-01-01 23:54:46,264 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:54:46,265 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2019-01-01 23:54:46,274 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a070d318/d851ebd629b347d980fabdeabaf6b044/FLAGb7a2b87b4 [2019-01-01 23:54:46,681 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a070d318/d851ebd629b347d980fabdeabaf6b044 [2019-01-01 23:54:46,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:54:46,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:54:46,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:46,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:54:46,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:54:46,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:46" (1/1) ... [2019-01-01 23:54:46,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:46, skipping insertion in model container [2019-01-01 23:54:46,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:54:46" (1/1) ... [2019-01-01 23:54:46,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:54:46,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:54:46,980 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:46,988 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:54:47,016 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:54:47,034 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:54:47,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:47 WrapperNode [2019-01-01 23:54:47,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:54:47,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:47,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:54:47,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:54:47,048 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:47" (1/1) ... [2019-01-01 23:54:47,055 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:47" (1/1) ... [2019-01-01 23:54:47,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:54:47,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:54:47,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:54:47,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:54:47,095 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:47" (1/1) ... [2019-01-01 23:54:47,095 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:47" (1/1) ... [2019-01-01 23:54:47,096 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:47" (1/1) ... [2019-01-01 23:54:47,096 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:47" (1/1) ... [2019-01-01 23:54:47,100 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:47" (1/1) ... [2019-01-01 23:54:47,103 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:47" (1/1) ... [2019-01-01 23:54:47,104 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:47" (1/1) ... [2019-01-01 23:54:47,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:54:47,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:54:47,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:54:47,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:54:47,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:47" (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:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:54:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:54:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-01 23:54:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-01 23:54:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-01 23:54:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-01 23:54:47,625 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:54:47,625 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:54:47,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:47 BoogieIcfgContainer [2019-01-01 23:54:47,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:54:47,630 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:54:47,631 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:54:47,635 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:54:47,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:47,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:54:46" (1/3) ... [2019-01-01 23:54:47,637 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e1279ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:47, skipping insertion in model container [2019-01-01 23:54:47,637 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:47,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:54:47" (2/3) ... [2019-01-01 23:54:47,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e1279ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:54:47, skipping insertion in model container [2019-01-01 23:54:47,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:54:47,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:54:47" (3/3) ... [2019-01-01 23:54:47,640 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_6_true-unreach-call_true-termination.c [2019-01-01 23:54:47,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:54:47,705 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:54:47,705 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:54:47,705 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:54:47,706 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:54:47,706 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:54:47,706 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:54:47,706 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:54:47,706 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:54:47,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:47,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:47,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:47,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:47,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:47,767 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:54:47,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 23:54:47,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:47,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:47,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:47,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:54:47,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:47,783 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-01-01 23:54:47,783 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:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-01-01 23:54:47,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:47,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-01-01 23:54:47,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:47,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:47,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-01-01 23:54:47,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:48,446 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 23:54:48,485 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:48,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:48,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:48,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:48,488 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:48,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:48,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:48,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:48,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:48,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:48,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:48,514 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:54:48,521 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:54:48,527 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:54:48,529 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:54:48,532 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:54:48,539 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:54:48,542 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:54:48,547 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:54:48,549 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:54:48,559 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:54:48,831 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:48,832 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:54:48,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:48,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:48,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:48,847 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:54:48,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:48,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:48,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:48,884 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:54:48,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:48,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:48,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:48,922 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:54:48,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:48,973 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:54:48,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:48,989 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:54:49,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,027 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:54:49,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,037 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) [2019-01-01 23:54:49,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,071 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,083 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:54:49,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:49,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,113 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:54:49,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:49,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,139 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:54:49,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:49,164 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:49,165 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:54:49,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:49,189 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:54:49,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:49,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:49,273 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:49,275 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:49,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:49,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:49,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:49,276 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:49,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:49,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:49,276 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:49,276 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-01 23:54:49,276 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:49,276 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:49,279 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:54:49,281 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:54:49,283 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:54:49,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:49,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:49,295 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:54:49,298 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:54:49,300 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:54:49,303 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:54:49,315 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:54:49,723 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-01 23:54:50,046 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:54:50,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:50,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:50,083 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:54:50,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,095 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:54:50,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,100 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:54:50,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,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:54:50,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,110 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:54:50,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,115 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:54:50,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,120 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:54:50,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,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:54:50,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:50,131 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:54:50,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:50,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:50,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:50,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:50,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:50,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:50,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:50,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:50,156 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:50,159 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:50,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:50,161 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:50,164 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:50,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-01-01 23:54:50,166 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:50,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:50,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:50,598 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:54:50,615 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:54:50,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-01-01 23:54:51,012 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:54:51,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:54:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:54:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-01-01 23:54:51,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 23:54:51,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:51,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 23:54:51,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:51,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 23:54:51,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:51,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-01-01 23:54:51,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:51,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-01-01 23:54:51,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 23:54:51,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-01 23:54:51,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-01-01 23:54:51,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:51,051 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-01-01 23:54:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-01-01 23:54:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-01-01 23:54:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 23:54:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-01-01 23:54:51,090 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:54:51,090 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 23:54:51,090 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:54:51,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-01-01 23:54:51,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:51,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:51,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:51,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:51,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:51,095 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 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:54:51,095 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:54:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-01-01 23:54:51,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:51,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,251 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:54:51,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:51,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:51,256 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-01-01 23:54:51,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:51,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:51,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,350 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:54:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:54:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:54:51,351 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:54:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:54:51,357 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-01-01 23:54:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:51,606 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-01-01 23:54:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:54:51,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-01-01 23:54:51,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:51,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-01-01 23:54:51,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-01 23:54:51,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 23:54:51,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-01-01 23:54:51,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:51,620 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-01-01 23:54:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-01-01 23:54:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-01 23:54:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 23:54:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-01-01 23:54:51,629 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:54:51,629 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-01 23:54:51,629 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:54:51,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-01-01 23:54:51,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:51,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:51,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:51,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:51,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:51,634 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 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:54:51,634 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:54:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-01-01 23:54:51,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:51,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,799 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:54:51,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:51,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:51,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:51,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:51,838 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:54:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 23:54:51,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-01-01 23:54:51,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:51,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:51,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:52,108 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:52,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:52,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:52,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:52,109 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:52,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:52,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:52,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:52,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:52,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:52,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:52,112 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:54:52,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:54:52,118 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:54:52,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:54:52,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:54:52,137 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:54:52,140 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:54:52,142 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:54:52,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:52,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:52,209 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:54:52,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:52,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:52,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:52,219 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:54:52,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:52,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:52,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:52,245 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:54:52,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:52,267 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:54:52,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:52,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:53,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:53,331 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:53,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:53,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:53,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:53,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:53,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:53,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:53,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:53,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-01 23:54:53,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:53,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:53,351 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:54:53,354 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:54:53,364 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:54:53,367 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:54:53,370 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:54:53,374 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:54:53,378 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:54:53,381 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:54:53,548 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:53,549 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:53,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:53,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:53,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:53,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:53,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:53,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:53,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:53,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:53,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:53,557 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:54:53,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:53,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:53,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:53,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:53,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:53,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:53,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:53,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:53,561 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:54:53,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:53,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:53,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:53,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:53,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:53,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:53,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:53,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:53,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:53,575 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:53,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:53,576 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:53,576 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:53,577 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-01 23:54:53,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:53,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:53,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:53,990 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:54:53,991 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:54:53,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-01-01 23:54:54,421 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:54:54,423 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:54:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:54:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-01-01 23:54:54,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-01-01 23:54:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-01-01 23:54:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-01-01 23:54:54,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:54,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-01-01 23:54:54,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:54,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-01-01 23:54:54,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-01 23:54:54,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-01 23:54:54,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-01-01 23:54:54,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:54,449 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-01-01 23:54:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-01-01 23:54:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-01-01 23:54:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-01 23:54:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-01-01 23:54:54,472 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-01-01 23:54:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:54:54,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:54:54,473 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2019-01-01 23:54:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:54,732 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-01-01 23:54:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:54:54,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-01-01 23:54:54,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:54,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-01-01 23:54:54,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-01 23:54:54,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-01 23:54:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-01-01 23:54:54,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:54,752 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-01-01 23:54:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-01-01 23:54:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-01-01 23:54:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-01 23:54:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-01-01 23:54:54,774 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:54:54,774 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-01 23:54:54,774 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:54:54,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-01-01 23:54:54,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:54,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:54,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:54,784 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:54:54,784 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:54:54,785 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:54:54,785 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-01 23:54:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-01-01 23:54:54,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:54,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:54,955 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:54:54,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:54,956 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:54:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-01-01 23:54:55,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 23:54:55,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 23:54:55,079 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-01-01 23:54:55,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:55,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,233 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:54:55,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:55,234 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:54:55,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:55,300 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:54:55,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 23:54:55,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 23:54:55,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:54:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:54:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:54:55,323 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-01-01 23:54:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:55,453 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-01-01 23:54:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:54:55,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-01-01 23:54:55,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:55,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-01-01 23:54:55,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-01 23:54:55,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-01 23:54:55,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-01-01 23:54:55,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:55,478 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-01-01 23:54:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-01-01 23:54:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-01-01 23:54:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 23:54:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-01-01 23:54:55,498 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:54:55,498 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-01 23:54:55,498 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:54:55,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-01-01 23:54:55,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:54:55,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:55,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:55,513 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:54:55,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:55,519 INFO L794 eck$LassoCheckResult]: Stem: 1902#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 1869#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1873#fibo1ENTRY ~n := #in~n; 1907#L8 assume !(~n < 1); 1868#L10 assume !(1 == ~n); 1854#L13 call #t~ret0 := fibo2(~n - 1);< 1886#fibo2ENTRY ~n := #in~n; 1988#L18 assume !(~n < 1); 1987#L20 assume !(1 == ~n); 1853#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1935#L8 assume !(~n < 1); 1934#L10 assume !(1 == ~n); 1863#L13 call #t~ret0 := fibo2(~n - 1);< 1932#fibo2ENTRY ~n := #in~n; 1956#L18 assume !(~n < 1); 1946#L20 assume !(1 == ~n); 1892#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1935#L8 assume !(~n < 1); 1934#L10 assume !(1 == ~n); 1863#L13 call #t~ret0 := fibo2(~n - 1);< 1932#fibo2ENTRY ~n := #in~n; 1956#L18 assume !(~n < 1); 1946#L20 assume 1 == ~n;#res := 1; 1862#fibo2FINAL assume true; 1864#fibo2EXIT >#49#return; 1891#L13-1 call #t~ret1 := fibo2(~n - 2);< 1893#fibo2ENTRY ~n := #in~n; 1904#L18 assume !(~n < 1); 1911#L20 assume !(1 == ~n); 1892#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1936#L8 assume !(~n < 1); 1942#L10 assume 1 == ~n;#res := 1; 1941#fibo1FINAL assume true; 1937#fibo1EXIT >#45#return; 1927#L23-1 call #t~ret3 := fibo1(~n - 2);< 1872#fibo1ENTRY ~n := #in~n; 1933#L8 assume !(~n < 1); 1930#L10 assume !(1 == ~n); 1851#L13 call #t~ret0 := fibo2(~n - 1);< 1925#fibo2ENTRY ~n := #in~n; 1923#L18 assume !(~n < 1); 1919#L20 assume 1 == ~n;#res := 1; 1875#fibo2FINAL assume true; 1905#fibo2EXIT >#49#return; 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume ~n < 1;#res := 0; 1914#fibo2FINAL assume true; 1991#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#47#return; 1978#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1969#fibo2FINAL assume true; 1963#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#45#return; 1966#L23-1 call #t~ret3 := fibo1(~n - 2);< 1983#fibo1ENTRY ~n := #in~n; 1984#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1913#L13 call #t~ret0 := fibo2(~n - 1);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume 1 == ~n;#res := 1; 1977#fibo2FINAL assume true; 1973#fibo2EXIT >#49#return; 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume ~n < 1;#res := 0; 1914#fibo2FINAL assume true; 1991#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#47#return; 1978#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1969#fibo2FINAL assume true; 1963#fibo2EXIT >#49#return; 1906#L13-1 [2019-01-01 23:54:55,519 INFO L796 eck$LassoCheckResult]: Loop: 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume !(1 == ~n); 1965#L23 call #t~ret2 := fibo1(~n - 1);< 1983#fibo1ENTRY ~n := #in~n; 1984#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1913#L13 call #t~ret0 := fibo2(~n - 1);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume 1 == ~n;#res := 1; 1977#fibo2FINAL assume true; 1973#fibo2EXIT >#49#return; 1906#L13-1 [2019-01-01 23:54:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-01-01 23:54:55,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:55,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-01 23:54:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:55,806 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:54:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:54:55,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:54:55,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:55,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-01 23:54:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 23:54:55,931 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2019-01-01 23:54:55,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:56,204 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:56,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:56,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:56,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:56,204 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:56,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:56,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:56,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:56,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:56,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:56,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:56,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:54:56,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:54:56,215 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:54:56,218 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:54:56,243 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:54:56,268 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:54:56,293 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:54:56,366 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:54:56,370 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:54:56,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:56,455 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:54:56,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,468 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:54:56,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,493 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,496 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,496 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:54:56,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,523 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:54:56,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,548 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,551 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:54:56,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,583 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,583 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:54:56,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:56,609 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:56,609 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:54:56,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:56,632 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:54:56,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:56,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:58,314 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:58,316 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:58,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:58,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:58,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:58,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:58,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:58,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:58,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:58,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-01 23:54:58,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:58,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:58,325 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:54:58,350 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:54:58,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:58,374 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:54:58,376 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:54:58,382 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:54:58,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:58,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:58,397 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:54:58,702 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:58,703 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:58,703 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:54:58,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,707 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:54:58,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,710 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:54:58,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,714 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:54:58,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,717 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:54:58,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,720 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:54:58,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:58,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:58,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:58,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:58,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:58,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:58,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:58,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:58,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:58,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:58,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:58,732 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:58,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:58,732 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:58,733 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:58,733 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-01 23:54:58,733 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:58,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:59,487 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:54:59,488 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:54:59,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:00,076 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:00,077 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:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2019-01-01 23:55:00,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:00,081 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:00,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:00,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:00,524 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:00,525 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:00,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:01,298 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:01,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:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2019-01-01 23:55:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:01,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:01,306 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:01,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:01,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:01,896 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:01,898 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:01,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-01 23:55:02,410 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:02,414 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:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:55:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2019-01-01 23:55:02,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-01 23:55:02,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:02,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2019-01-01 23:55:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:02,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2019-01-01 23:55:02,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:02,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2019-01-01 23:55:02,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2019-01-01 23:55:02,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2019-01-01 23:55:02,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-01-01 23:55:02,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2019-01-01 23:55:02,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2019-01-01 23:55:02,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:02,534 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2019-01-01 23:55:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2019-01-01 23:55:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2019-01-01 23:55:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-01-01 23:55:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2019-01-01 23:55:02,691 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2019-01-01 23:55:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 23:55:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-01-01 23:55:02,693 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 14 states. [2019-01-01 23:55:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:03,454 INFO L93 Difference]: Finished difference Result 1364 states and 1982 transitions. [2019-01-01 23:55:03,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 23:55:03,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1364 states and 1982 transitions. [2019-01-01 23:55:03,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2019-01-01 23:55:03,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1364 states to 835 states and 1100 transitions. [2019-01-01 23:55:03,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2019-01-01 23:55:03,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2019-01-01 23:55:03,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 835 states and 1100 transitions. [2019-01-01 23:55:03,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:03,502 INFO L705 BuchiCegarLoop]: Abstraction has 835 states and 1100 transitions. [2019-01-01 23:55:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states and 1100 transitions. [2019-01-01 23:55:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 811. [2019-01-01 23:55:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-01-01 23:55:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1054 transitions. [2019-01-01 23:55:03,541 INFO L728 BuchiCegarLoop]: Abstraction has 811 states and 1054 transitions. [2019-01-01 23:55:03,541 INFO L608 BuchiCegarLoop]: Abstraction has 811 states and 1054 transitions. [2019-01-01 23:55:03,543 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:55:03,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 811 states and 1054 transitions. [2019-01-01 23:55:03,553 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2019-01-01 23:55:03,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:03,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:03,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:03,557 INFO L794 eck$LassoCheckResult]: Stem: 9041#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 8989#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8990#fibo1ENTRY ~n := #in~n; 9226#L8 assume !(~n < 1); 9220#L10 assume !(1 == ~n); 8992#L13 call #t~ret0 := fibo2(~n - 1);< 9210#fibo2ENTRY ~n := #in~n; 9211#L18 assume !(~n < 1); 9207#L20 assume !(1 == ~n); 9204#L23 call #t~ret2 := fibo1(~n - 1);< 9206#fibo1ENTRY ~n := #in~n; 9228#L8 assume !(~n < 1); 9222#L10 assume !(1 == ~n); 9168#L13 call #t~ret0 := fibo2(~n - 1);< 9217#fibo2ENTRY ~n := #in~n; 9230#L18 assume !(~n < 1); 9225#L20 assume !(1 == ~n); 9205#L23 call #t~ret2 := fibo1(~n - 1);< 9206#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9256#L10 assume 1 == ~n;#res := 1; 9254#fibo1FINAL assume true; 9255#fibo1EXIT >#45#return; 9163#L23-1 call #t~ret3 := fibo1(~n - 2);< 9710#fibo1ENTRY ~n := #in~n; 9729#L8 assume ~n < 1;#res := 0; 9728#fibo1FINAL assume true; 9724#fibo1EXIT >#47#return; 9721#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 9719#fibo2FINAL assume true; 9714#fibo2EXIT >#49#return; 9387#L13-1 [2019-01-01 23:55:03,559 INFO L796 eck$LassoCheckResult]: Loop: 9387#L13-1 call #t~ret1 := fibo2(~n - 2);< 9460#fibo2ENTRY ~n := #in~n; 9459#L18 assume !(~n < 1); 9440#L20 assume !(1 == ~n); 9013#L23 call #t~ret2 := fibo1(~n - 1);< 9376#fibo1ENTRY ~n := #in~n; 9359#L8 assume !(~n < 1); 9354#L10 assume !(1 == ~n); 9356#L13 call #t~ret0 := fibo2(~n - 1);< 9697#fibo2ENTRY ~n := #in~n; 9701#L18 assume !(~n < 1); 9700#L20 assume 1 == ~n;#res := 1; 9699#fibo2FINAL assume true; 9695#fibo2EXIT >#49#return; 9011#L13-1 call #t~ret1 := fibo2(~n - 2);< 9014#fibo2ENTRY ~n := #in~n; 9042#L18 assume ~n < 1;#res := 0; 9052#fibo2FINAL assume true; 9744#fibo2EXIT >#51#return; 9743#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9742#fibo1FINAL assume true; 9733#fibo1EXIT >#45#return; 9006#L23-1 call #t~ret3 := fibo1(~n - 2);< 8966#fibo1ENTRY ~n := #in~n; 9705#L8 assume !(~n < 1); 9703#L10 assume !(1 == ~n); 8965#L13 call #t~ret0 := fibo2(~n - 1);< 9008#fibo2ENTRY ~n := #in~n; 9707#L18 assume !(~n < 1); 9054#L20 assume 1 == ~n;#res := 1; 9055#fibo2FINAL assume true; 9716#fibo2EXIT >#49#return; 9387#L13-1 [2019-01-01 23:55:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2019-01-01 23:55:03,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:04,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:04,022 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:04,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:04,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:04,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 23:55:04,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:04,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2019-01-01 23:55:04,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:04,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 23:55:04,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:04,251 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:04,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:04,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:04,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:04,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 23:55:04,306 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 23:55:04,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-01-01 23:55:04,307 INFO L87 Difference]: Start difference. First operand 811 states and 1054 transitions. cyclomatic complexity: 259 Second operand 13 states. [2019-01-01 23:55:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:04,796 INFO L93 Difference]: Finished difference Result 974 states and 1340 transitions. [2019-01-01 23:55:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 23:55:04,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 974 states and 1340 transitions. [2019-01-01 23:55:04,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2019-01-01 23:55:04,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 974 states to 971 states and 1336 transitions. [2019-01-01 23:55:04,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2019-01-01 23:55:04,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 483 [2019-01-01 23:55:04,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 971 states and 1336 transitions. [2019-01-01 23:55:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:04,833 INFO L705 BuchiCegarLoop]: Abstraction has 971 states and 1336 transitions. [2019-01-01 23:55:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states and 1336 transitions. [2019-01-01 23:55:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 831. [2019-01-01 23:55:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-01-01 23:55:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1086 transitions. [2019-01-01 23:55:04,870 INFO L728 BuchiCegarLoop]: Abstraction has 831 states and 1086 transitions. [2019-01-01 23:55:04,870 INFO L608 BuchiCegarLoop]: Abstraction has 831 states and 1086 transitions. [2019-01-01 23:55:04,871 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:55:04,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1086 transitions. [2019-01-01 23:55:04,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 93 [2019-01-01 23:55:04,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:04,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:04,881 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:04,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:04,881 INFO L794 eck$LassoCheckResult]: Stem: 11033#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 10998#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10999#fibo1ENTRY ~n := #in~n; 11238#L8 assume !(~n < 1); 11237#L10 assume !(1 == ~n); 11226#L13 call #t~ret0 := fibo2(~n - 1);< 11233#fibo2ENTRY ~n := #in~n; 11230#L18 assume !(~n < 1); 11227#L20 assume !(1 == ~n); 11017#L23 call #t~ret2 := fibo1(~n - 1);< 11225#fibo1ENTRY ~n := #in~n; 11223#L8 assume !(~n < 1); 11220#L10 assume !(1 == ~n); 11077#L13 call #t~ret0 := fibo2(~n - 1);< 11212#fibo2ENTRY ~n := #in~n; 11208#L18 assume !(~n < 1); 11209#L20 assume !(1 == ~n); 11213#L23 call #t~ret2 := fibo1(~n - 1);< 11234#fibo1ENTRY ~n := #in~n; 11231#L8 assume !(~n < 1); 11228#L10 assume !(1 == ~n); 11076#L13 call #t~ret0 := fibo2(~n - 1);< 11212#fibo2ENTRY ~n := #in~n; 11208#L18 assume !(~n < 1); 11209#L20 assume !(1 == ~n); 11213#L23 call #t~ret2 := fibo1(~n - 1);< 11234#fibo1ENTRY ~n := #in~n; 11235#L8 assume !(~n < 1); 11260#L10 assume 1 == ~n;#res := 1; 11261#fibo1FINAL assume true; 11456#fibo1EXIT >#45#return; 11057#L23-1 call #t~ret3 := fibo1(~n - 2);< 11446#fibo1ENTRY ~n := #in~n; 11467#L8 assume ~n < 1;#res := 0; 11453#fibo1FINAL assume true; 11444#fibo1EXIT >#47#return; 11445#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11506#fibo2FINAL assume true; 11417#fibo2EXIT >#49#return; 11304#L13-1 [2019-01-01 23:55:04,881 INFO L796 eck$LassoCheckResult]: Loop: 11304#L13-1 call #t~ret1 := fibo2(~n - 2);< 11307#fibo2ENTRY ~n := #in~n; 11306#L18 assume !(~n < 1); 11305#L20 assume !(1 == ~n); 11295#L23 call #t~ret2 := fibo1(~n - 1);< 11301#fibo1ENTRY ~n := #in~n; 11300#L8 assume !(~n < 1); 11297#L10 assume 1 == ~n;#res := 1; 11298#fibo1FINAL assume true; 11472#fibo1EXIT >#45#return; 11426#L23-1 call #t~ret3 := fibo1(~n - 2);< 11448#fibo1ENTRY ~n := #in~n; 11458#L8 assume !(~n < 1); 11454#L10 assume !(1 == ~n); 11420#L13 call #t~ret0 := fibo2(~n - 1);< 11431#fibo2ENTRY ~n := #in~n; 11465#L18 assume !(~n < 1); 11452#L20 assume 1 == ~n;#res := 1; 11443#fibo2FINAL assume true; 11425#fibo2EXIT >#49#return; 11304#L13-1 [2019-01-01 23:55:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 2 times [2019-01-01 23:55:04,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:04,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:05,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:05,140 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:05,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:55:05,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:55:05,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:05,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:05,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:05,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2019-01-01 23:55:05,503 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 534326566, now seen corresponding path program 1 times [2019-01-01 23:55:05,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 23:55:05,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:05,582 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:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:05,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:55:05,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:05,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 23:55:05,641 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:55:05,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:55:05,641 INFO L87 Difference]: Start difference. First operand 831 states and 1086 transitions. cyclomatic complexity: 271 Second operand 7 states. [2019-01-01 23:55:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:05,829 INFO L93 Difference]: Finished difference Result 1019 states and 1344 transitions. [2019-01-01 23:55:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:55:05,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1019 states and 1344 transitions. [2019-01-01 23:55:05,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2019-01-01 23:55:05,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1019 states to 1004 states and 1323 transitions. [2019-01-01 23:55:05,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2019-01-01 23:55:05,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2019-01-01 23:55:05,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1004 states and 1323 transitions. [2019-01-01 23:55:05,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:05,875 INFO L705 BuchiCegarLoop]: Abstraction has 1004 states and 1323 transitions. [2019-01-01 23:55:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states and 1323 transitions. [2019-01-01 23:55:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 935. [2019-01-01 23:55:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-01-01 23:55:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1236 transitions. [2019-01-01 23:55:05,962 INFO L728 BuchiCegarLoop]: Abstraction has 935 states and 1236 transitions. [2019-01-01 23:55:05,962 INFO L608 BuchiCegarLoop]: Abstraction has 935 states and 1236 transitions. [2019-01-01 23:55:05,962 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:55:05,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1236 transitions. [2019-01-01 23:55:05,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2019-01-01 23:55:05,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:05,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:05,977 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:05,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-01 23:55:05,982 INFO L794 eck$LassoCheckResult]: Stem: 13077#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 13044#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13045#fibo1ENTRY ~n := #in~n; 13299#L8 assume !(~n < 1); 13298#L10 assume !(1 == ~n); 13294#L13 call #t~ret0 := fibo2(~n - 1);< 13297#fibo2ENTRY ~n := #in~n; 13296#L18 assume !(~n < 1); 13295#L20 assume !(1 == ~n); 13270#L23 call #t~ret2 := fibo1(~n - 1);< 13293#fibo1ENTRY ~n := #in~n; 13292#L8 assume !(~n < 1); 13291#L10 assume !(1 == ~n); 13047#L13 call #t~ret0 := fibo2(~n - 1);< 13269#fibo2ENTRY ~n := #in~n; 13266#L18 assume !(~n < 1); 13267#L20 assume !(1 == ~n); 13271#L23 call #t~ret2 := fibo1(~n - 1);< 13287#fibo1ENTRY ~n := #in~n; 13283#L8 assume !(~n < 1); 13279#L10 assume !(1 == ~n); 13048#L13 call #t~ret0 := fibo2(~n - 1);< 13269#fibo2ENTRY ~n := #in~n; 13266#L18 assume !(~n < 1); 13267#L20 assume !(1 == ~n); 13271#L23 call #t~ret2 := fibo1(~n - 1);< 13287#fibo1ENTRY ~n := #in~n; 13288#L8 assume !(~n < 1); 13328#L10 assume 1 == ~n;#res := 1; 13329#fibo1FINAL assume true; 13901#fibo1EXIT >#45#return; 13888#L23-1 call #t~ret3 := fibo1(~n - 2);< 13889#fibo1ENTRY ~n := #in~n; 13900#L8 assume ~n < 1;#res := 0; 13899#fibo1FINAL assume true; 13887#fibo1EXIT >#47#return; 13881#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13875#fibo2FINAL assume true; 13874#fibo2EXIT >#49#return; 13422#L13-1 [2019-01-01 23:55:05,983 INFO L796 eck$LassoCheckResult]: Loop: 13422#L13-1 call #t~ret1 := fibo2(~n - 2);< 13426#fibo2ENTRY ~n := #in~n; 13425#L18 assume !(~n < 1); 13424#L20 assume !(1 == ~n); 13057#L23 call #t~ret2 := fibo1(~n - 1);< 13420#fibo1ENTRY ~n := #in~n; 13419#L8 assume !(~n < 1); 13417#L10 assume !(1 == ~n); 13056#L13 call #t~ret0 := fibo2(~n - 1);< 13058#fibo2ENTRY ~n := #in~n; 13844#L18 assume !(~n < 1); 13095#L20 assume 1 == ~n;#res := 1; 13096#fibo2FINAL assume true; 13847#fibo2EXIT >#49#return; 13064#L13-1 call #t~ret1 := fibo2(~n - 2);< 13066#fibo2ENTRY ~n := #in~n; 13078#L18 assume ~n < 1;#res := 0; 13093#fibo2FINAL assume true; 13919#fibo2EXIT >#51#return; 13917#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 13916#fibo1FINAL assume true; 13897#fibo1EXIT >#45#return; 13824#L23-1 call #t~ret3 := fibo1(~n - 2);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume !(1 == ~n); 13022#L13 call #t~ret0 := fibo2(~n - 1);< 13821#fibo2ENTRY ~n := #in~n; 13820#L18 assume !(~n < 1); 13818#L20 assume !(1 == ~n); 13021#L23 call #t~ret2 := fibo1(~n - 1);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume !(1 == ~n); 13022#L13 call #t~ret0 := fibo2(~n - 1);< 13821#fibo2ENTRY ~n := #in~n; 13820#L18 assume !(~n < 1); 13818#L20 assume 1 == ~n;#res := 1; 13819#fibo2FINAL assume true; 13867#fibo2EXIT >#49#return; 13422#L13-1 call #t~ret1 := fibo2(~n - 2);< 13866#fibo2ENTRY ~n := #in~n; 13913#L18 assume ~n < 1;#res := 0; 13911#fibo2FINAL assume true; 13910#fibo2EXIT >#51#return; 13906#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 13903#fibo1FINAL assume true; 13890#fibo1EXIT >#45#return; 13824#L23-1 call #t~ret3 := fibo1(~n - 2);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume 1 == ~n;#res := 1; 13826#fibo1FINAL assume true; 13892#fibo1EXIT >#47#return; 13886#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13880#fibo2FINAL assume true; 13873#fibo2EXIT >#49#return; 13422#L13-1 [2019-01-01 23:55:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 3 times [2019-01-01 23:55:05,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:05,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:06,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:06,300 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:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 23:55:06,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 23:55:06,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:06,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:55:06,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:06,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2019-01-01 23:55:06,415 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1765387140, now seen corresponding path program 1 times [2019-01-01 23:55:06,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:06,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:06,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 23:55:06,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:06,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:06,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:06,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 61 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 23:55:06,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:06,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-01-01 23:55:06,693 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 23:55:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-01-01 23:55:06,696 INFO L87 Difference]: Start difference. First operand 935 states and 1236 transitions. cyclomatic complexity: 317 Second operand 20 states. [2019-01-01 23:55:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:07,606 INFO L93 Difference]: Finished difference Result 988 states and 1194 transitions. [2019-01-01 23:55:07,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 23:55:07,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1194 transitions. [2019-01-01 23:55:07,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2019-01-01 23:55:07,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 529 states and 608 transitions. [2019-01-01 23:55:07,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2019-01-01 23:55:07,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2019-01-01 23:55:07,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 608 transitions. [2019-01-01 23:55:07,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:07,629 INFO L705 BuchiCegarLoop]: Abstraction has 529 states and 608 transitions. [2019-01-01 23:55:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 608 transitions. [2019-01-01 23:55:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 446. [2019-01-01 23:55:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-01 23:55:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 512 transitions. [2019-01-01 23:55:07,652 INFO L728 BuchiCegarLoop]: Abstraction has 446 states and 512 transitions. [2019-01-01 23:55:07,652 INFO L608 BuchiCegarLoop]: Abstraction has 446 states and 512 transitions. [2019-01-01 23:55:07,653 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:55:07,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 512 transitions. [2019-01-01 23:55:07,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 69 [2019-01-01 23:55:07,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:07,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:07,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:07,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:07,665 INFO L794 eck$LassoCheckResult]: Stem: 15355#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 15319#L37 call main_#t~ret4 := fibo1(main_~x~0);< 15320#fibo1ENTRY ~n := #in~n; 15470#L8 assume !(~n < 1); 15468#L10 assume !(1 == ~n); 15450#L13 call #t~ret0 := fibo2(~n - 1);< 15455#fibo2ENTRY ~n := #in~n; 15484#L18 assume !(~n < 1); 15479#L20 assume !(1 == ~n); 15458#L23 call #t~ret2 := fibo1(~n - 1);< 15477#fibo1ENTRY ~n := #in~n; 15462#L8 assume !(~n < 1); 15461#L10 assume !(1 == ~n); 15443#L13 call #t~ret0 := fibo2(~n - 1);< 15459#fibo2ENTRY ~n := #in~n; 15657#L18 assume !(~n < 1); 15658#L20 assume !(1 == ~n); 15520#L23 call #t~ret2 := fibo1(~n - 1);< 15521#fibo1ENTRY ~n := #in~n; 15595#L8 assume !(~n < 1); 15596#L10 assume !(1 == ~n); 15585#L13 call #t~ret0 := fibo2(~n - 1);< 15586#fibo2ENTRY ~n := #in~n; 15602#L18 assume !(~n < 1); 15593#L20 assume 1 == ~n;#res := 1; 15594#fibo2FINAL assume true; 15584#fibo2EXIT >#49#return; 15582#L13-1 call #t~ret1 := fibo2(~n - 2);< 15669#fibo2ENTRY ~n := #in~n; 15671#L18 assume ~n < 1;#res := 0; 15581#fibo2FINAL assume true; 15583#fibo2EXIT >#51#return; 15573#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15574#fibo1FINAL assume true; 15519#fibo1EXIT >#45#return; 15436#L23-1 call #t~ret3 := fibo1(~n - 2);< 15315#fibo1ENTRY ~n := #in~n; 15440#L8 assume !(~n < 1); 15435#L10 assume !(1 == ~n); 15314#L13 call #t~ret0 := fibo2(~n - 1);< 15430#fibo2ENTRY ~n := #in~n; 15427#L18 assume !(~n < 1); 15428#L20 assume 1 == ~n;#res := 1; 15460#fibo2FINAL assume true; 15445#fibo2EXIT >#49#return; 15327#L13-1 [2019-01-01 23:55:07,666 INFO L796 eck$LassoCheckResult]: Loop: 15327#L13-1 call #t~ret1 := fibo2(~n - 2);< 15425#fibo2ENTRY ~n := #in~n; 15420#L18 assume !(~n < 1); 15416#L20 assume !(1 == ~n); 15417#L23 call #t~ret2 := fibo1(~n - 1);< 15487#fibo1ENTRY ~n := #in~n; 15503#L8 assume !(~n < 1); 15501#L10 assume !(1 == ~n); 15499#L13 call #t~ret0 := fibo2(~n - 1);< 15500#fibo2ENTRY ~n := #in~n; 15518#L18 assume !(~n < 1); 15511#L20 assume 1 == ~n;#res := 1; 15504#fibo2FINAL assume true; 15498#fibo2EXIT >#49#return; 15495#L13-1 call #t~ret1 := fibo2(~n - 2);< 15497#fibo2ENTRY ~n := #in~n; 15507#L18 assume ~n < 1;#res := 0; 15505#fibo2FINAL assume true; 15493#fibo2EXIT >#51#return; 15492#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15491#fibo1FINAL assume true; 15485#fibo1EXIT >#45#return; 15453#L23-1 call #t~ret3 := fibo1(~n - 2);< 15483#fibo1ENTRY ~n := #in~n; 15546#L8 assume !(~n < 1); 15465#L10 assume !(1 == ~n); 15326#L13 call #t~ret0 := fibo2(~n - 1);< 15454#fibo2ENTRY ~n := #in~n; 15490#L18 assume !(~n < 1); 15488#L20 assume 1 == ~n;#res := 1; 15489#fibo2FINAL assume true; 15545#fibo2EXIT >#49#return; 15327#L13-1 [2019-01-01 23:55:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1947124180, now seen corresponding path program 1 times [2019-01-01 23:55:07,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:07,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:07,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-01 23:55:08,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:08,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:08,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:08,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:08,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:08,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 18 [2019-01-01 23:55:08,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 2 times [2019-01-01 23:55:08,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:08,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 23:55:08,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:08,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:55:08,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:55:08,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:55:08,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 23:55:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 23:55:08,774 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:55:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:55:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:55:08,777 INFO L87 Difference]: Start difference. First operand 446 states and 512 transitions. cyclomatic complexity: 74 Second operand 10 states. [2019-01-01 23:55:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:09,100 INFO L93 Difference]: Finished difference Result 364 states and 423 transitions. [2019-01-01 23:55:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:55:09,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 364 states and 423 transitions. [2019-01-01 23:55:09,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 23:55:09,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 364 states to 243 states and 288 transitions. [2019-01-01 23:55:09,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2019-01-01 23:55:09,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-01-01 23:55:09,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 288 transitions. [2019-01-01 23:55:09,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:55:09,109 INFO L705 BuchiCegarLoop]: Abstraction has 243 states and 288 transitions. [2019-01-01 23:55:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 288 transitions. [2019-01-01 23:55:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2019-01-01 23:55:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 23:55:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2019-01-01 23:55:09,122 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 272 transitions. [2019-01-01 23:55:09,122 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 272 transitions. [2019-01-01 23:55:09,122 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:55:09,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 272 transitions. [2019-01-01 23:55:09,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 23:55:09,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:55:09,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:55:09,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:09,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:55:09,132 INFO L794 eck$LassoCheckResult]: Stem: 16429#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 16378#L37 call main_#t~ret4 := fibo1(main_~x~0);< 16379#fibo1ENTRY ~n := #in~n; 16526#L8 assume !(~n < 1); 16525#L10 assume !(1 == ~n); 16502#L13 call #t~ret0 := fibo2(~n - 1);< 16523#fibo2ENTRY ~n := #in~n; 16522#L18 assume !(~n < 1); 16501#L20 assume !(1 == ~n); 16503#L23 call #t~ret2 := fibo1(~n - 1);< 16517#fibo1ENTRY ~n := #in~n; 16516#L8 assume !(~n < 1); 16515#L10 assume !(1 == ~n); 16511#L13 call #t~ret0 := fibo2(~n - 1);< 16514#fibo2ENTRY ~n := #in~n; 16513#L18 assume !(~n < 1); 16512#L20 assume !(1 == ~n); 16415#L23 call #t~ret2 := fibo1(~n - 1);< 16510#fibo1ENTRY ~n := #in~n; 16509#L8 assume !(~n < 1); 16508#L10 assume !(1 == ~n); 16414#L13 call #t~ret0 := fibo2(~n - 1);< 16416#fibo2ENTRY ~n := #in~n; 16529#L18 assume !(~n < 1); 16528#L20 assume 1 == ~n;#res := 1; 16527#fibo2FINAL assume true; 16524#fibo2EXIT >#49#return; 16519#L13-1 call #t~ret1 := fibo2(~n - 2);< 16518#fibo2ENTRY ~n := #in~n; 16520#L18 assume ~n < 1;#res := 0; 16558#fibo2FINAL assume true; 16557#fibo2EXIT >#51#return; 16556#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 16555#fibo1FINAL assume true; 16554#fibo1EXIT >#45#return; 16552#L23-1 call #t~ret3 := fibo1(~n - 2);< 16553#fibo1ENTRY ~n := #in~n; 16564#L8 assume ~n < 1;#res := 0; 16560#fibo1FINAL assume true; 16551#fibo1EXIT >#47#return; 16550#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 16549#fibo2FINAL assume true; 16548#fibo2EXIT >#49#return; 16404#L13-1 call #t~ret1 := fibo2(~n - 2);< 16420#fibo2ENTRY ~n := #in~n; 16436#L18 assume !(~n < 1); 16448#L20 assume !(1 == ~n); 16418#L23 call #t~ret2 := fibo1(~n - 1);< 16575#fibo1ENTRY ~n := #in~n; 16593#L8 assume !(~n < 1); 16592#L10 assume !(1 == ~n); 16496#L13 call #t~ret0 := fibo2(~n - 1);< 16538#fibo2ENTRY ~n := #in~n; 16495#L18 assume !(~n < 1); 16497#L20 assume !(1 == ~n); 16409#L23 call #t~ret2 := fibo1(~n - 1);< 16493#fibo1ENTRY [2019-01-01 23:55:09,132 INFO L796 eck$LassoCheckResult]: Loop: 16493#fibo1ENTRY ~n := #in~n; 16492#L8 assume !(~n < 1); 16490#L10 assume !(1 == ~n); 16485#L13 call #t~ret0 := fibo2(~n - 1);< 16486#fibo2ENTRY ~n := #in~n; 16491#L18 assume !(~n < 1); 16489#L20 assume !(1 == ~n); 16410#L23 call #t~ret2 := fibo1(~n - 1);< 16493#fibo1ENTRY [2019-01-01 23:55:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1585247159, now seen corresponding path program 1 times [2019-01-01 23:55:09,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:09,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:09,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:55:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 23:55:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:55:09,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:55:09,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:09,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 23:55:09,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:55:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2019-01-01 23:55:09,485 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:55:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 2 times [2019-01-01 23:55:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:55:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:55:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:55:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:55:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:55:09,599 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:09,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:09,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:09,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:09,600 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:55:09,600 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:09,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:09,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:09,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration10_Loop [2019-01-01 23:55:09,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:09,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:09,603 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:09,621 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:09,623 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:09,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,628 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:09,633 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:09,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,641 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:09,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:09,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,706 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:09,706 INFO L412 LassoAnalysis]: Checking for nontermination... 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:09,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:55:09,713 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:09,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:55:09,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:55:09,797 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:55:09,799 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:55:09,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:55:09,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:55:09,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:55:09,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:55:09,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:55:09,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:55:09,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:55:09,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration10_Loop [2019-01-01 23:55:09,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:55:09,800 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:55:09,802 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:09,816 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:09,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,821 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:09,824 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:09,830 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:09,832 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:09,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:55:09,839 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:09,845 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:09,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:55:09,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:55:09,894 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:09,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:55:09,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:55:09,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:55:09,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:55:09,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:55:09,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:55:09,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:55:09,901 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:55:09,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:55:09,910 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:55:09,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:55:09,910 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:55:09,910 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:55:09,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-01-01 23:55:09,911 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:55:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,375 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:10,376 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:10,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2019-01-01 23:55:10,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 251 states and 292 transitions. Complement of second has 22 states. [2019-01-01 23:55:10,575 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:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-01-01 23:55:10,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 56 letters. Loop has 8 letters. [2019-01-01 23:55:10,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:10,579 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:10,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:10,794 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:10,795 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:10,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2019-01-01 23:55:11,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 251 states and 292 transitions. Complement of second has 22 states. [2019-01-01 23:55:11,004 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:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-01-01 23:55:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 56 letters. Loop has 8 letters. [2019-01-01 23:55:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:11,006 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:55:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:55:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:11,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,567 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 23:55:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:55:11,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:55:11,649 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:11,649 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:11,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2019-01-01 23:55:11,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 470 states and 541 transitions. Complement of second has 27 states. [2019-01-01 23:55:11,917 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:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:55:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2019-01-01 23:55:11,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 56 letters. Loop has 8 letters. [2019-01-01 23:55:11,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:11,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-01 23:55:11,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:11,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 56 letters. Loop has 16 letters. [2019-01-01 23:55:11,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:55:11,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 541 transitions. [2019-01-01 23:55:11,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:11,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 0 states and 0 transitions. [2019-01-01 23:55:11,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:55:11,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:55:11,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:55:11,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:55:11,935 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:11,935 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 23:55:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-01-01 23:55:11,936 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 18 states. [2019-01-01 23:55:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:55:11,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:55:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:55:11,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:55:11,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:11,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:55:11,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:55:11,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:55:11,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:55:11,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:55:11,937 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:11,937 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:11,937 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:55:11,937 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:55:11,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:55:11,938 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:55:11,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:55:11,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:55:11 BoogieIcfgContainer [2019-01-01 23:55:11,949 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:55:11,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:55:11,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:55:11,951 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:55:11,951 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:47" (3/4) ... [2019-01-01 23:55:11,957 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:55:11,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:55:11,959 INFO L168 Benchmark]: Toolchain (without parser) took 25272.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.6 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -329.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:11,960 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:55:11,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:11,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.32 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:11,962 INFO L168 Benchmark]: Boogie Preprocessor took 22.97 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:11,962 INFO L168 Benchmark]: RCFGBuilder took 522.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:11,963 INFO L168 Benchmark]: BuchiAutomizer took 24319.25 ms. Allocated memory was 1.2 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: -178.4 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:55:11,965 INFO L168 Benchmark]: Witness Printer took 7.57 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:11,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.32 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 22.97 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 522.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24319.25 ms. Allocated memory was 1.2 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: -178.4 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.57 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 13 terminating modules (9 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. 9 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 12.5s. Construction of modules took 3.7s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 534 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 935 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 338 SDtfs, 741 SDslu, 842 SDs, 0 SdLazy, 1893 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI6 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: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...