./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_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 e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:45,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:45,414 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:45,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:45,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:45,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:45,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:45,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:45,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:45,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:45,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:45,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:45,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:45,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:45,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:45,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:45,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:45,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:45,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:45,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:45,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:45,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:45,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:45,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:45,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:45,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:45,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:45,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:45,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:45,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:45,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:45,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:45,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:45,457 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:45,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:45,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:45,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:33:45,477 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:45,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:45,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:45,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:45,479 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:45,479 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:45,480 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:45,480 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:45,480 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:45,480 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:45,480 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:45,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:45,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:45,482 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:45,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:45,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:45,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:45,483 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:45,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:45,484 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:45,484 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:45,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:45,485 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 -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2019-01-14 04:33:45,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:45,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:45,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:45,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:45,549 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:45,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2019-01-14 04:33:45,616 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65400b979/b3cb8fb7153c406f98853fc8150dd4db/FLAG0a0159b1d [2019-01-14 04:33:46,118 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:46,119 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2019-01-14 04:33:46,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65400b979/b3cb8fb7153c406f98853fc8150dd4db/FLAG0a0159b1d [2019-01-14 04:33:46,475 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65400b979/b3cb8fb7153c406f98853fc8150dd4db [2019-01-14 04:33:46,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:46,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:46,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:46,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:46,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:46,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2359d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46, skipping insertion in model container [2019-01-14 04:33:46,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:46,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:46,720 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:46,726 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:46,753 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:46,769 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:46,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46 WrapperNode [2019-01-14 04:33:46,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:46,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:46,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:46,772 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:46,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:46,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:46,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:46,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:46,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... [2019-01-14 04:33:46,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:46,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:46,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:46,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:46,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-14 04:33:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-14 04:33:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-14 04:33:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-14 04:33:47,360 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:47,361 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:47,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:47 BoogieIcfgContainer [2019-01-14 04:33:47,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:47,363 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:47,363 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:47,367 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:47,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:47,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:46" (1/3) ... [2019-01-14 04:33:47,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d1d5348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:47, skipping insertion in model container [2019-01-14 04:33:47,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:47,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:46" (2/3) ... [2019-01-14 04:33:47,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d1d5348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:47, skipping insertion in model container [2019-01-14 04:33:47,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:47,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:47" (3/3) ... [2019-01-14 04:33:47,372 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_true-unreach-call_true-termination.c [2019-01-14 04:33:47,434 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:47,435 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:47,435 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:47,435 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:47,436 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:47,436 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:47,436 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:47,436 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:47,436 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:47,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 04:33:47,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:47,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:47,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:47,493 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:47,493 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:47,493 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:47,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 04:33:47,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:47,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:47,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:47,498 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:47,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:47,507 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-01-14 04:33:47,508 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-14 04:33:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-01-14 04:33:47,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-01-14 04:33:47,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-01-14 04:33:47,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:48,056 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-14 04:33:48,166 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:48,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:48,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:48,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:48,168 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:48,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:48,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:48,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:48,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:48,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:48,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:48,519 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,524 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,533 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,535 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-14 04:33:48,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,563 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-14 04:33:48,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,603 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,672 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-14 04:33:48,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,712 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-14 04:33:48,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,723 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,763 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,764 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-14 04:33:48,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,785 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,788 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,788 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-14 04:33:48,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,812 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,812 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-14 04:33:48,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,842 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,842 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-14 04:33:48,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,865 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-14 04:33:48,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:48,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,943 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:48,945 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:48,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:48,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:48,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:48,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:48,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,946 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:48,946 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:48,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:48,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:48,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:48,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:49,436 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 04:33:49,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:49,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:49,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:49,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:49,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:49,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:49,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:49,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:49,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:49,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:49,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:49,842 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:49,853 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:49,855 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:49,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:49,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:49,858 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:49,859 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-01-14 04:33:49,864 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:49,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:50,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:50,213 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-14 04:33:50,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-01-14 04:33:50,606 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-14 04:33:50,610 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-14 04:33:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-01-14 04:33:50,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:33:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:50,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-14 04:33:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:50,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-14 04:33:50,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:50,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-01-14 04:33:50,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:50,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-01-14 04:33:50,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 04:33:50,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-14 04:33:50,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-01-14 04:33:50,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:50,648 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-01-14 04:33:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-01-14 04:33:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-01-14 04:33:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 04:33:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-01-14 04:33:50,686 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-14 04:33:50,687 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-14 04:33:50,687 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:50,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-01-14 04:33:50,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:50,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:50,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:50,691 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:50,692 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:50,692 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 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-14 04:33:50,692 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-14 04:33:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-01-14 04:33:50,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:33:50,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:50,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:50,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-01-14 04:33:50,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:50,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:50,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:33:50,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:50,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:50,921 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:33:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:33:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:33:50,927 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-01-14 04:33:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:51,152 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-01-14 04:33:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:51,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-01-14 04:33:51,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:51,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-01-14 04:33:51,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-14 04:33:51,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-14 04:33:51,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-01-14 04:33:51,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:51,163 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-01-14 04:33:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-01-14 04:33:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-14 04:33:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 04:33:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-01-14 04:33:51,172 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-14 04:33:51,172 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-14 04:33:51,172 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:51,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-01-14 04:33:51,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 04:33:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:51,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:51,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:51,176 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 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-14 04:33:51,177 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-14 04:33:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-01-14 04:33:51,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:51,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:51,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:51,306 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-14 04:33:51,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:51,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:51,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:51,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 04:33:51,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-01-14 04:33:51,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:51,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:51,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:51,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:51,597 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:51,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:51,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:51,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:51,598 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:51,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:51,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:51,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:51,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:51,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:51,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:51,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,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-14 04:33:51,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,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-14 04:33:51,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:51,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:51,710 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-14 04:33:51,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:51,715 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:51,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:51,721 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-14 04:33:51,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:51,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:51,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:51,747 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-14 04:33:51,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:51,771 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:51,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:51,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:52,681 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:52,683 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:52,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:52,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:52,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:52,684 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:52,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:52,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:52,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:52,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:52,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:52,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:52,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:52,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:52,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:52,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:52,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:52,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:52,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:52,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:52,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:52,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:52,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:52,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:52,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:52,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:52,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:52,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:52,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:52,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:52,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:52,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:52,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:52,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:52,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:52,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:52,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:52,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:52,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:52,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:52,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:52,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:52,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:52,887 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:52,887 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:52,887 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:52,888 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:52,888 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-14 04:33:52,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:52,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:53,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:53,198 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-14 04:33:53,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-01-14 04:33:53,646 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-14 04:33:53,649 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-14 04:33:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:33:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-01-14 04:33:53,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-01-14 04:33:53,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:53,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-01-14 04:33:53,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:53,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-01-14 04:33:53,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:53,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-01-14 04:33:53,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:33:53,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-01-14 04:33:53,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-14 04:33:53,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-14 04:33:53,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-01-14 04:33:53,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:53,668 INFO L706 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-01-14 04:33:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-01-14 04:33:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-01-14 04:33:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-14 04:33:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-01-14 04:33:53,688 INFO L729 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-01-14 04:33:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 04:33:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 04:33:53,689 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2019-01-14 04:33:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:53,911 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-01-14 04:33:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:33:53,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-01-14 04:33:53,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:33:53,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-01-14 04:33:53,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-14 04:33:53,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-14 04:33:53,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-01-14 04:33:53,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:53,928 INFO L706 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-01-14 04:33:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-01-14 04:33:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-01-14 04:33:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-14 04:33:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-01-14 04:33:53,951 INFO L729 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-14 04:33:53,951 INFO L609 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-01-14 04:33:53,951 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:53,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-01-14 04:33:53,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:33:53,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:53,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:53,963 INFO L867 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-14 04:33:53,964 INFO L868 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-14 04:33:53,967 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-14 04:33:53,967 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~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2019-01-14 04:33:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-01-14 04:33:53,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:54,105 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-14 04:33:54,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:54,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:54,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:54,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 23 proven. 71 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-01-14 04:33:54,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:54,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2019-01-14 04:33:54,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-01-14 04:33:54,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:54,664 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-14 04:33:54,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:54,665 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-14 04:33:54,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:54,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:54,712 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-14 04:33:54,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 04:33:54,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-14 04:33:54,734 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:33:54,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:33:54,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:33:54,734 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-01-14 04:33:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:54,844 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-01-14 04:33:54,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:54,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-01-14 04:33:54,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:33:54,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-01-14 04:33:54,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-14 04:33:54,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-14 04:33:54,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-01-14 04:33:54,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:54,868 INFO L706 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-01-14 04:33:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-01-14 04:33:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-01-14 04:33:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 04:33:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-01-14 04:33:54,898 INFO L729 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-14 04:33:54,898 INFO L609 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-01-14 04:33:54,898 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:54,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-01-14 04:33:54,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:33:54,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:54,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:54,913 INFO L867 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-14 04:33:54,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:54,914 INFO L794 eck$LassoCheckResult]: Stem: 1917#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1880#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1886#fibo1ENTRY ~n := #in~n; 1923#L8 assume !(~n < 1); 1879#L10 assume !(1 == ~n); 1881#L13 call #t~ret0 := fibo2(~n - 1);< 1900#fibo2ENTRY ~n := #in~n; 1921#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1905#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume 1 == ~n;#res := 1; 1874#fibo2FINAL assume true; 1875#fibo2EXIT >#49#return; 1870#L13-1 call #t~ret1 := fibo2(~n - 2);< 1906#fibo2ENTRY ~n := #in~n; 1927#L18 assume !(~n < 1); 1925#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1948#L8 assume !(~n < 1); 1955#L10 assume 1 == ~n;#res := 1; 1956#fibo1FINAL assume true; 1949#fibo1EXIT >#45#return; 1877#L23-1 call #t~ret3 := fibo1(~n - 2);< 1885#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1942#L10 assume !(1 == ~n); 1884#L13 call #t~ret0 := fibo2(~n - 1);< 1938#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 1931#L20 assume 1 == ~n;#res := 1; 1932#fibo2FINAL assume true; 1922#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#45#return; 1977#L23-1 call #t~ret3 := fibo1(~n - 2);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#49#return; 1919#L13-1 [2019-01-14 04:33:54,914 INFO L796 eck$LassoCheckResult]: Loop: 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume !(1 == ~n); 1979#L23 call #t~ret2 := fibo1(~n - 1);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 [2019-01-14 04:33:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-01-14 04:33:54,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:54,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-14 04:33:55,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:55,299 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-14 04:33:55,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:33:55,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:33:55,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:55,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-14 04:33:55,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:55,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-14 04:33:55,474 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2019-01-14 04:33:55,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:55,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:55,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:55,755 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-14 04:33:55,860 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:55,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:55,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:55,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:55,861 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:55,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:55,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:55,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:55,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:55,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:55,862 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:55,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:55,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:55,933 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-14 04:33:55,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:55,941 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:55,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:55,954 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-14 04:33:55,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:55,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:55,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:55,979 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-14 04:33:56,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:56,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:56,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:56,003 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) [2019-01-14 04:33:56,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:56,026 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:56,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:56,030 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-14 04:33:56,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:56,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:56,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:56,053 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-14 04:33:56,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:56,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:56,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:56,085 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-14 04:33:56,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:56,108 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-14 04:33:56,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:56,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:57,560 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:57,563 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:57,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:57,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:57,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:57,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:57,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:57,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:57,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:57,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:57,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:57,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:57,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:57,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:57,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:57,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:57,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:57,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:57,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:57,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:57,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:57,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:57,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:57,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:57,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:57,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:57,754 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:57,755 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:57,755 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:57,755 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:57,755 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-14 04:33:57,756 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:57,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:58,210 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-14 04:33:58,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-14 04:33:58,752 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-14 04:33:58,760 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-14 04:33:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:33:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2019-01-14 04:33:58,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-14 04:33:58,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:58,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:59,463 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-14 04:33:59,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-14 04:33:59,949 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-14 04:33:59,951 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-14 04:33:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:33:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2019-01-14 04:33:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-14 04:33:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,955 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:00,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:00,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:00,478 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-14 04:34:00,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2019-01-14 04:34:00,825 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-14 04:34:00,832 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-14 04:34:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:34:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2019-01-14 04:34:00,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2019-01-14 04:34:00,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:00,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2019-01-14 04:34:00,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:00,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2019-01-14 04:34:00,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:00,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2019-01-14 04:34:00,871 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2019-01-14 04:34:00,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2019-01-14 04:34:00,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-01-14 04:34:00,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2019-01-14 04:34:00,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2019-01-14 04:34:00,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:00,906 INFO L706 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2019-01-14 04:34:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2019-01-14 04:34:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2019-01-14 04:34:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-01-14 04:34:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2019-01-14 04:34:01,004 INFO L729 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2019-01-14 04:34:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 04:34:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-14 04:34:01,005 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2019-01-14 04:34:02,201 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-14 04:34:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:02,734 INFO L93 Difference]: Finished difference Result 1248 states and 1763 transitions. [2019-01-14 04:34:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:34:02,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1763 transitions. [2019-01-14 04:34:02,753 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2019-01-14 04:34:02,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 608 states and 744 transitions. [2019-01-14 04:34:02,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2019-01-14 04:34:02,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-01-14 04:34:02,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 744 transitions. [2019-01-14 04:34:02,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:02,767 INFO L706 BuchiCegarLoop]: Abstraction has 608 states and 744 transitions. [2019-01-14 04:34:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 744 transitions. [2019-01-14 04:34:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2019-01-14 04:34:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-14 04:34:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 726 transitions. [2019-01-14 04:34:02,792 INFO L729 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2019-01-14 04:34:02,792 INFO L609 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2019-01-14 04:34:02,792 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:02,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 726 transitions. [2019-01-14 04:34:02,799 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2019-01-14 04:34:02,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:02,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:02,802 INFO L867 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-14 04:34:02,804 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:02,805 INFO L794 eck$LassoCheckResult]: Stem: 8925#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 8891#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8892#fibo1ENTRY ~n := #in~n; 9055#L8 assume !(~n < 1); 9054#L10 assume !(1 == ~n); 9051#L13 call #t~ret0 := fibo2(~n - 1);< 9053#fibo2ENTRY ~n := #in~n; 9052#L18 assume !(~n < 1); 9050#L20 assume !(1 == ~n); 9036#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9043#L8 assume !(~n < 1); 9041#L10 assume !(1 == ~n); 9009#L13 call #t~ret0 := fibo2(~n - 1);< 9039#fibo2ENTRY ~n := #in~n; 9044#L18 assume !(~n < 1); 9042#L20 assume !(1 == ~n); 9035#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9046#L8 assume !(~n < 1); 9144#L10 assume 1 == ~n;#res := 1; 9145#fibo1FINAL assume true; 9138#fibo1EXIT >#45#return; 8994#L23-1 call #t~ret3 := fibo1(~n - 2);< 9119#fibo1ENTRY ~n := #in~n; 9131#L8 assume ~n < 1;#res := 0; 9128#fibo1FINAL assume true; 9118#fibo1EXIT >#47#return; 9107#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9104#fibo2FINAL assume true; 9095#fibo2EXIT >#49#return; 9080#L13-1 [2019-01-14 04:34:02,805 INFO L796 eck$LassoCheckResult]: Loop: 9080#L13-1 call #t~ret1 := fibo2(~n - 2);< 9084#fibo2ENTRY ~n := #in~n; 9085#L18 assume !(~n < 1); 9078#L20 assume !(1 == ~n); 9063#L23 call #t~ret2 := fibo1(~n - 1);< 9156#fibo1ENTRY ~n := #in~n; 9071#L8 assume !(~n < 1); 9072#L10 assume !(1 == ~n); 8881#L13 call #t~ret0 := fibo2(~n - 1);< 9314#fibo2ENTRY ~n := #in~n; 9394#L18 assume !(~n < 1); 9342#L20 assume 1 == ~n;#res := 1; 9340#fibo2FINAL assume true; 9312#fibo2EXIT >#49#return; 9310#L13-1 call #t~ret1 := fibo2(~n - 2);< 9311#fibo2ENTRY ~n := #in~n; 9333#L18 assume ~n < 1;#res := 0; 9332#fibo2FINAL assume true; 9309#fibo2EXIT >#51#return; 9308#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 9307#fibo1FINAL assume true; 9303#fibo1EXIT >#45#return; 9114#L23-1 call #t~ret3 := fibo1(~n - 2);< 9117#fibo1ENTRY ~n := #in~n; 9167#L8 assume !(~n < 1); 9163#L10 assume !(1 == ~n); 9157#L13 call #t~ret0 := fibo2(~n - 1);< 9161#fibo2ENTRY ~n := #in~n; 9160#L18 assume !(~n < 1); 9158#L20 assume 1 == ~n;#res := 1; 9159#fibo2FINAL assume true; 9185#fibo2EXIT >#49#return; 9080#L13-1 [2019-01-14 04:34:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2019-01-14 04:34:02,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2019-01-14 04:34:02,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:02,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:02,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,956 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-14 04:34:02,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:02,957 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-14 04:34:02,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,988 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-14 04:34:03,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:03,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 04:34:03,008 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:03,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:03,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:03,009 INFO L87 Difference]: Start difference. First operand 590 states and 726 transitions. cyclomatic complexity: 145 Second operand 10 states. [2019-01-14 04:34:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:03,303 INFO L93 Difference]: Finished difference Result 377 states and 480 transitions. [2019-01-14 04:34:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:03,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 480 transitions. [2019-01-14 04:34:03,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-14 04:34:03,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 276 states and 335 transitions. [2019-01-14 04:34:03,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2019-01-14 04:34:03,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2019-01-14 04:34:03,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 335 transitions. [2019-01-14 04:34:03,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:03,315 INFO L706 BuchiCegarLoop]: Abstraction has 276 states and 335 transitions. [2019-01-14 04:34:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 335 transitions. [2019-01-14 04:34:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2019-01-14 04:34:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-14 04:34:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 324 transitions. [2019-01-14 04:34:03,326 INFO L729 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2019-01-14 04:34:03,326 INFO L609 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2019-01-14 04:34:03,326 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:34:03,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 324 transitions. [2019-01-14 04:34:03,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-14 04:34:03,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:03,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:03,331 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:03,331 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:03,332 INFO L794 eck$LassoCheckResult]: Stem: 9999#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 9972#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9973#fibo1ENTRY ~n := #in~n; 10078#L8 assume !(~n < 1); 10077#L10 assume !(1 == ~n); 10074#L13 call #t~ret0 := fibo2(~n - 1);< 10076#fibo2ENTRY ~n := #in~n; 10075#L18 assume !(~n < 1); 10073#L20 assume !(1 == ~n); 10051#L23 call #t~ret2 := fibo1(~n - 1);< 10062#fibo1ENTRY ~n := #in~n; 10060#L8 assume !(~n < 1); 10058#L10 assume !(1 == ~n); 10055#L13 call #t~ret0 := fibo2(~n - 1);< 10056#fibo2ENTRY ~n := #in~n; 10061#L18 assume !(~n < 1); 10059#L20 assume 1 == ~n;#res := 1; 10057#fibo2FINAL assume true; 10054#fibo2EXIT >#49#return; 10039#L13-1 call #t~ret1 := fibo2(~n - 2);< 10049#fibo2ENTRY ~n := #in~n; 10047#L18 assume !(~n < 1); 10045#L20 assume !(1 == ~n); 10028#L23 call #t~ret2 := fibo1(~n - 1);< 10037#fibo1ENTRY ~n := #in~n; 10035#L8 assume !(~n < 1); 10030#L10 assume !(1 == ~n); 10011#L13 call #t~ret0 := fibo2(~n - 1);< 10026#fibo2ENTRY ~n := #in~n; 10022#L18 assume !(~n < 1); 10016#L20 assume !(1 == ~n); 10008#L23 call #t~ret2 := fibo1(~n - 1);< 10012#fibo1ENTRY ~n := #in~n; 10024#L8 assume !(~n < 1); 10020#L10 assume 1 == ~n;#res := 1; 10014#fibo1FINAL assume true; 10007#fibo1EXIT >#45#return; 10009#L23-1 call #t~ret3 := fibo1(~n - 2);< 10071#fibo1ENTRY ~n := #in~n; 10064#L8 assume ~n < 1;#res := 0; 10065#fibo1FINAL assume true; 10070#fibo1EXIT >#47#return; 10069#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10068#fibo2FINAL assume true; 10066#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2019-01-14 04:34:03,332 INFO L796 eck$LassoCheckResult]: Loop: 10029#L23 call #t~ret2 := fibo1(~n - 1);< 10038#fibo1ENTRY ~n := #in~n; 10036#L8 assume !(~n < 1); 10032#L10 assume !(1 == ~n); 9970#L13 call #t~ret0 := fibo2(~n - 1);< 10027#fibo2ENTRY ~n := #in~n; 10023#L18 assume !(~n < 1); 10018#L20 assume !(1 == ~n); 9982#L23 call #t~ret2 := fibo1(~n - 1);< 10013#fibo1ENTRY ~n := #in~n; 10025#L8 assume !(~n < 1); 10021#L10 assume 1 == ~n;#res := 1; 10015#fibo1FINAL assume true; 10010#fibo1EXIT >#45#return; 9969#L23-1 call #t~ret3 := fibo1(~n - 2);< 9971#fibo1ENTRY ~n := #in~n; 10072#L8 assume ~n < 1;#res := 0; 9993#fibo1FINAL assume true; 9981#fibo1EXIT >#47#return; 9976#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9977#fibo2FINAL assume true; 10124#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2019-01-14 04:34:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -582096202, now seen corresponding path program 1 times [2019-01-14 04:34:03,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 04:34:03,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:03,459 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-14 04:34:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:03,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 04:34:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:03,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-01-14 04:34:03,790 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 1 times [2019-01-14 04:34:03,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:03,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:03,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:03,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:34:03,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:03,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:03,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:03,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:34:03,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:03,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:34:03,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:03,955 INFO L87 Difference]: Start difference. First operand 270 states and 324 transitions. cyclomatic complexity: 59 Second operand 10 states. [2019-01-14 04:34:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:04,147 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2019-01-14 04:34:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:04,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 190 transitions. [2019-01-14 04:34:04,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-14 04:34:04,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 128 states and 145 transitions. [2019-01-14 04:34:04,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2019-01-14 04:34:04,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-01-14 04:34:04,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2019-01-14 04:34:04,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:04,154 INFO L706 BuchiCegarLoop]: Abstraction has 128 states and 145 transitions. [2019-01-14 04:34:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2019-01-14 04:34:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2019-01-14 04:34:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 04:34:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2019-01-14 04:34:04,159 INFO L729 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-01-14 04:34:04,160 INFO L609 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-01-14 04:34:04,160 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:34:04,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 138 transitions. [2019-01-14 04:34:04,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-14 04:34:04,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:04,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:04,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:04,165 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:04,165 INFO L794 eck$LassoCheckResult]: Stem: 10683#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 10661#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10663#fibo1ENTRY ~n := #in~n; 10696#L8 assume !(~n < 1); 10660#L10 assume !(1 == ~n); 10662#L13 call #t~ret0 := fibo2(~n - 1);< 10674#fibo2ENTRY ~n := #in~n; 10688#L18 assume !(~n < 1); 10692#L20 assume !(1 == ~n); 10658#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10682#L8 assume !(~n < 1); 10657#L10 assume 1 == ~n;#res := 1; 10659#fibo1FINAL assume true; 10737#fibo1EXIT >#45#return; 10735#L23-1 call #t~ret3 := fibo1(~n - 2);< 10736#fibo1ENTRY ~n := #in~n; 10742#L8 assume ~n < 1;#res := 0; 10741#fibo1FINAL assume true; 10734#fibo1EXIT >#47#return; 10727#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10723#fibo2FINAL assume true; 10718#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2019-01-14 04:34:04,165 INFO L796 eck$LassoCheckResult]: Loop: 10668#L23-1 call #t~ret3 := fibo1(~n - 2);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume 1 == ~n;#res := 1; 10717#fibo1FINAL assume true; 10761#fibo1EXIT >#45#return; 10652#L23-1 call #t~ret3 := fibo1(~n - 2);< 10653#fibo1ENTRY ~n := #in~n; 10680#L8 assume ~n < 1;#res := 0; 10675#fibo1FINAL assume true; 10666#fibo1EXIT >#47#return; 10664#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10665#fibo2FINAL assume true; 10719#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2019-01-14 04:34:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash -444366370, now seen corresponding path program 1 times [2019-01-14 04:34:04,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 04:34:04,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:04,428 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-14 04:34:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 04:34:04,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:04,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-14 04:34:04,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1179096830, now seen corresponding path program 1 times [2019-01-14 04:34:04,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 04:34:04,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:04,700 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-14 04:34:04,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:04,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 04:34:04,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:04,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-14 04:34:04,802 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 04:34:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 04:34:04,803 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. cyclomatic complexity: 19 Second operand 11 states. [2019-01-14 04:34:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:05,006 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-01-14 04:34:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:34:05,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2019-01-14 04:34:05,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-14 04:34:05,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 127 states and 141 transitions. [2019-01-14 04:34:05,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2019-01-14 04:34:05,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2019-01-14 04:34:05,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 141 transitions. [2019-01-14 04:34:05,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:05,011 INFO L706 BuchiCegarLoop]: Abstraction has 127 states and 141 transitions. [2019-01-14 04:34:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 141 transitions. [2019-01-14 04:34:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-01-14 04:34:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 04:34:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2019-01-14 04:34:05,015 INFO L729 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-01-14 04:34:05,015 INFO L609 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-01-14 04:34:05,015 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:34:05,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 138 transitions. [2019-01-14 04:34:05,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-14 04:34:05,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:05,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:05,017 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:05,017 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:05,018 INFO L794 eck$LassoCheckResult]: Stem: 11219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 11193#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11194#fibo1ENTRY ~n := #in~n; 11230#L8 assume !(~n < 1); 11198#L10 assume !(1 == ~n); 11199#L13 call #t~ret0 := fibo2(~n - 1);< 11211#fibo2ENTRY ~n := #in~n; 11225#L18 assume !(~n < 1); 11233#L20 assume !(1 == ~n); 11196#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11223#L8 assume !(~n < 1); 11195#L10 assume 1 == ~n;#res := 1; 11197#fibo1FINAL assume true; 11206#fibo1EXIT >#45#return; 11207#L23-1 call #t~ret3 := fibo1(~n - 2);< 11278#fibo1ENTRY ~n := #in~n; 11296#L8 assume ~n < 1;#res := 0; 11294#fibo1FINAL assume true; 11277#fibo1EXIT >#47#return; 11275#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11273#fibo2FINAL assume true; 11253#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2019-01-14 04:34:05,018 INFO L796 eck$LassoCheckResult]: Loop: 11214#L23-1 call #t~ret3 := fibo1(~n - 2);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume 1 == ~n;#res := 1; 11265#fibo1FINAL assume true; 11264#fibo1EXIT >#45#return; 11262#L23-1 call #t~ret3 := fibo1(~n - 2);< 11263#fibo1ENTRY ~n := #in~n; 11269#L8 assume ~n < 1;#res := 0; 11266#fibo1FINAL assume true; 11261#fibo1EXIT >#47#return; 11260#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11259#fibo2FINAL assume true; 11252#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2019-01-14 04:34:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:05,018 INFO L82 PathProgramCache]: Analyzing trace with hash -167011978, now seen corresponding path program 1 times [2019-01-14 04:34:05,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:05,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:05,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:05,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:05,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 04:34:05,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:05,336 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-14 04:34:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 04:34:05,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:05,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-01-14 04:34:05,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:05,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1468819758, now seen corresponding path program 1 times [2019-01-14 04:34:05,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:05,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:05,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:05,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:05,636 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 04:34:06,136 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:06,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:06,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:06,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:06,137 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:06,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:06,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:06,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:06,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:06,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:06,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:06,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-14 04:34:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:06,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:06,296 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:06,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:06,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:06,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:06,308 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=2} Honda state: {fibo2_#t~ret2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:06,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:06,333 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:06,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:06,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:07,061 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:07,064 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:07,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:07,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:07,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:07,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:07,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:07,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:07,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:07,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:07,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:07,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:07,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,192 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:07,192 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:07,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:07,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:07,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:07,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:07,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:07,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:07,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:07,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:07,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:07,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:07,209 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:07,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:07,209 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:07,210 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:07,210 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-01-14 04:34:07,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:07,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:07,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 04:34:07,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-14 04:34:07,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-14 04:34:07,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2019-01-14 04:34:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 04:34:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-14 04:34:07,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-14 04:34:07,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:07,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:07,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:07,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 04:34:08,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2019-01-14 04:34:08,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-14 04:34:08,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2019-01-14 04:34:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 04:34:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-14 04:34:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-14 04:34:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:08,468 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:08,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:08,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 04:34:08,942 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 10 loop predicates [2019-01-14 04:34:08,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-14 04:34:09,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 777 states and 862 transitions. Complement of second has 114 states. [2019-01-14 04:34:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 04:34:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2019-01-14 04:34:09,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 39 letters. [2019-01-14 04:34:09,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:09,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 87 letters. Loop has 39 letters. [2019-01-14 04:34:09,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:09,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 78 letters. [2019-01-14 04:34:09,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:09,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 862 transitions. [2019-01-14 04:34:09,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2019-01-14 04:34:09,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 292 states and 307 transitions. [2019-01-14 04:34:09,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-14 04:34:09,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-01-14 04:34:09,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 307 transitions. [2019-01-14 04:34:09,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:09,818 INFO L706 BuchiCegarLoop]: Abstraction has 292 states and 307 transitions. [2019-01-14 04:34:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 307 transitions. [2019-01-14 04:34:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2019-01-14 04:34:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-14 04:34:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2019-01-14 04:34:09,832 INFO L729 BuchiCegarLoop]: Abstraction has 242 states and 256 transitions. [2019-01-14 04:34:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 04:34:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-14 04:34:09,833 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand 17 states. [2019-01-14 04:34:10,257 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:34:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:10,814 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2019-01-14 04:34:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 04:34:10,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 193 transitions. [2019-01-14 04:34:10,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-14 04:34:10,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 122 states and 129 transitions. [2019-01-14 04:34:10,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-01-14 04:34:10,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2019-01-14 04:34:10,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 129 transitions. [2019-01-14 04:34:10,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:10,822 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-01-14 04:34:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 129 transitions. [2019-01-14 04:34:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-14 04:34:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:34:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-01-14 04:34:10,826 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-01-14 04:34:10,826 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-01-14 04:34:10,826 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:34:10,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 128 transitions. [2019-01-14 04:34:10,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-14 04:34:10,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:10,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:10,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:10,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:10,829 INFO L794 eck$LassoCheckResult]: Stem: 13975#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13952#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13956#fibo1ENTRY ~n := #in~n; 13984#L8 assume !(~n < 1); 13951#L10 assume !(1 == ~n); 13953#L13 call #t~ret0 := fibo2(~n - 1);< 13994#fibo2ENTRY ~n := #in~n; 13982#L18 assume !(~n < 1); 13983#L20 assume !(1 == ~n); 13964#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13973#L8 assume !(~n < 1); 13979#L10 assume !(1 == ~n); 13946#L13 call #t~ret0 := fibo2(~n - 1);< 13965#fibo2ENTRY ~n := #in~n; 13977#L18 assume !(~n < 1); 13981#L20 assume !(1 == ~n); 13945#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13974#L8 assume !(~n < 1); 14047#L10 assume 1 == ~n;#res := 1; 14046#fibo1FINAL assume true; 14045#fibo1EXIT >#45#return; 13948#L23-1 call #t~ret3 := fibo1(~n - 2);< 13949#fibo1ENTRY ~n := #in~n; 14051#L8 assume ~n < 1;#res := 0; 14049#fibo1FINAL assume true; 14048#fibo1EXIT >#47#return; 13957#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13954#fibo2FINAL assume true; 13955#fibo2EXIT >#49#return; 13978#L13-1 call #t~ret1 := fibo2(~n - 2);< 13989#fibo2ENTRY ~n := #in~n; 14022#L18 assume !(~n < 1); 14023#L20 assume 1 == ~n;#res := 1; 13990#fibo2FINAL assume true; 13992#fibo2EXIT >#51#return; 14004#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14002#fibo1FINAL assume true; 13999#fibo1EXIT >#45#return; 13987#L23-1 call #t~ret3 := fibo1(~n - 2);< 13998#fibo1ENTRY ~n := #in~n; 14015#L8 assume !(~n < 1); 14014#L10 assume !(1 == ~n); 14012#L13 call #t~ret0 := fibo2(~n - 1);< 14013#fibo2ENTRY ~n := #in~n; 14026#L18 assume !(~n < 1); 14025#L20 assume !(1 == ~n); 13963#L23 call #t~ret2 := fibo1(~n - 1);< 14039#fibo1ENTRY ~n := #in~n; 14044#L8 assume !(~n < 1); 14043#L10 assume !(1 == ~n); 13943#L13 [2019-01-14 04:34:10,829 INFO L796 eck$LassoCheckResult]: Loop: 13943#L13 call #t~ret0 := fibo2(~n - 1);< 13962#fibo2ENTRY ~n := #in~n; 13976#L18 assume !(~n < 1); 13980#L20 assume !(1 == ~n); 13942#L23 call #t~ret2 := fibo1(~n - 1);< 13944#fibo1ENTRY ~n := #in~n; 13972#L8 assume !(~n < 1); 13950#L10 assume !(1 == ~n); 13943#L13 [2019-01-14 04:34:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:10,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1751159525, now seen corresponding path program 2 times [2019-01-14 04:34:10,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:10,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:10,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 04:34:11,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:11,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:11,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:34:11,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:34:11,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:11,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 04:34:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:11,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-01-14 04:34:11,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 2 times [2019-01-14 04:34:11,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:11,336 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:11,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:11,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:11,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:11,337 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:11,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:11,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:11,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:11,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration10_Loop [2019-01-14 04:34:11,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:11,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:11,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,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-14 04:34:11,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,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-14 04:34:11,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-14 04:34:11,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:11,461 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 04:34:11,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:11,469 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:11,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:11,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:13,261 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:13,263 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:13,263 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:13,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:13,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:13,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:13,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:13,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:13,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:13,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration10_Loop [2019-01-14 04:34:13,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:13,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:13,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,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-14 04:34:13,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-14 04:34:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:13,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:13,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:13,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:13,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:13,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:13,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:13,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:13,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:13,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:13,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:13,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:13,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:13,404 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:13,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:13,405 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:13,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:13,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-01-14 04:34:13,405 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:13,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:13,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:13,662 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-01-14 04:34:13,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 04:34:13,778 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 135 states and 143 transitions. Complement of second has 19 states. [2019-01-14 04:34:13,780 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-14 04:34:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:34:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-14 04:34:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-14 04:34:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:13,781 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:13,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:13,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:13,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:14,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-01-14 04:34:14,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 04:34:14,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 141 states and 149 transitions. Complement of second has 21 states. [2019-01-14 04:34:14,221 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-14 04:34:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:34:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2019-01-14 04:34:14,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-14 04:34:14,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:14,223 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:14,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:14,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:14,378 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 6 loop predicates [2019-01-14 04:34:14,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 04:34:14,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 192 states and 201 transitions. Complement of second has 30 states. [2019-01-14 04:34:14,549 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-14 04:34:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:34:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2019-01-14 04:34:14,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 8 letters. [2019-01-14 04:34:14,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:14,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 60 letters. Loop has 8 letters. [2019-01-14 04:34:14,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:14,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 16 letters. [2019-01-14 04:34:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:14,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 201 transitions. [2019-01-14 04:34:14,565 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:14,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2019-01-14 04:34:14,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:14,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:14,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:14,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:14,566 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:14,567 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:34:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:34:14,570 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 14 states. [2019-01-14 04:34:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:14,570 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:34:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:34:14,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:34:14,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:14,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:34:14,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:14,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:14,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:14,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:14,571 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:14,572 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:14,579 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:14,579 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:34:14,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:14,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:14,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:14,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:14 BoogieIcfgContainer [2019-01-14 04:34:14,604 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:14,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:14,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:14,609 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:14,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:47" (3/4) ... [2019-01-14 04:34:14,620 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:14,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:14,624 INFO L168 Benchmark]: Toolchain (without parser) took 28140.82 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 992.5 MB in the end (delta: -41.2 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:14,626 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:14,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:14,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.58 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:14,630 INFO L168 Benchmark]: Boogie Preprocessor took 26.31 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:14,631 INFO L168 Benchmark]: RCFGBuilder took 521.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:14,632 INFO L168 Benchmark]: BuchiAutomizer took 27240.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 134.6 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:14,637 INFO L168 Benchmark]: Witness Printer took 12.12 ms. Allocated memory is still 1.4 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:14,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.37 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 41.58 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 26.31 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 521.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27240.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 134.6 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. * Witness Printer took 12.12 ms. Allocated memory is still 1.4 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (9 trivial, 2 deterministic, 3 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 n and consists of 13 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.1s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 14.2s. Construction of modules took 4.5s. Büchi inclusion checks took 7.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 290 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 590 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 11/41 HoareTripleCheckerStatistics: 390 SDtfs, 786 SDslu, 839 SDs, 0 SdLazy, 2005 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf98 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf92 smp81 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...