./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd6d4490a7412402195d3193de0347508566f7c8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:03:04,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:04,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:04,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:04,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:04,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:04,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:04,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:04,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:04,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:04,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:04,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:04,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:04,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:04,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:04,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:04,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:04,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:04,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:04,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:04,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:04,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:04,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:04,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:04,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:04,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:04,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:04,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:04,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:04,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:04,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:04,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:04,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:04,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:04,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:04,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:04,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:03:04,962 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:04,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:04,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:04,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:04,964 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:04,964 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:04,964 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:04,965 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:04,965 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:04,965 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:04,966 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:04,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:04,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:04,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:04,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:04,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:04,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:04,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:04,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:04,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:04,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:04,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:04,969 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:04,969 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:04,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:04,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:04,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:04,971 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:04,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:04,971 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:04,971 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:04,973 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:04,973 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd6d4490a7412402195d3193de0347508566f7c8 [2018-11-29 00:03:05,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:05,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:05,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:05,037 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:05,038 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:05,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-29 00:03:05,119 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93bb4ef/dd5cb076a7d645759818ebd3515c2d89/FLAGcf34815d6 [2018-11-29 00:03:05,590 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:05,592 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-29 00:03:05,600 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93bb4ef/dd5cb076a7d645759818ebd3515c2d89/FLAGcf34815d6 [2018-11-29 00:03:05,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93bb4ef/dd5cb076a7d645759818ebd3515c2d89 [2018-11-29 00:03:05,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:05,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:05,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:05,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:05,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:05,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364f73cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05, skipping insertion in model container [2018-11-29 00:03:05,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:05,958 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:06,170 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:06,177 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:06,204 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:06,221 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:06,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06 WrapperNode [2018-11-29 00:03:06,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:06,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:06,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:06,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:06,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:06,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:06,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:06,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:06,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (1/1) ... [2018-11-29 00:03:06,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:06,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:06,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:06,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:06,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (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 [2018-11-29 00:03:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-29 00:03:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-29 00:03:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-29 00:03:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-29 00:03:06,753 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:06,753 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:06,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06 BoogieIcfgContainer [2018-11-29 00:03:06,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:06,755 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:06,755 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:06,758 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:06,759 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:05" (1/3) ... [2018-11-29 00:03:06,760 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13a70eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:06" (2/3) ... [2018-11-29 00:03:06,760 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13a70eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/3) ... [2018-11-29 00:03:06,762 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-29 00:03:06,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:06,830 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:06,830 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:06,830 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:06,830 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:06,830 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:06,831 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:06,831 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:06,831 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:06,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,895 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:06,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,910 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2018-11-29 00:03:06,910 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 [2018-11-29 00:03:06,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-11-29 00:03:06,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-11-29 00:03:07,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-11-29 00:03:07,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,434 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-29 00:03:07,553 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:07,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:07,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:07,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:07,554 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:07,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:07,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:07,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:07,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:07,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:07,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:07,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:07,897 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 [2018-11-29 00:03:07,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,924 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 [2018-11-29 00:03:07,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,951 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 [2018-11-29 00:03:07,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,996 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,997 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 [2018-11-29 00:03:08,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,031 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) [2018-11-29 00:03:08,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,071 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 [2018-11-29 00:03:08,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,084 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) [2018-11-29 00:03:08,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,116 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,132 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) [2018-11-29 00:03:08,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,163 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,172 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 [2018-11-29 00:03:08,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,196 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 [2018-11-29 00:03:08,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,221 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 [2018-11-29 00:03:08,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,243 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 [2018-11-29 00:03:08,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:08,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,329 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:08,331 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:08,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:08,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:08,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:08,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:08,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:08,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:08,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:08,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:08,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:08,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,781 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-29 00:03:09,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:09,073 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:09,075 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 [2018-11-29 00:03:09,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,090 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 [2018-11-29 00:03:09,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,099 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 [2018-11-29 00:03:09,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,108 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 [2018-11-29 00:03:09,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:09,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,125 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 [2018-11-29 00:03:09,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:09,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,142 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 [2018-11-29 00:03:09,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,152 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 [2018-11-29 00:03:09,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:09,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:09,185 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:09,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:09,191 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:09,191 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:09,194 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-29 00:03:09,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:09,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:09,625 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 [2018-11-29 00:03:09,626 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-11-29 00:03:10,004 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. [2018-11-29 00:03:10,006 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 [2018-11-29 00:03:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-29 00:03:10,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-29 00:03:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-29 00:03:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-11-29 00:03:10,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-11-29 00:03:10,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-29 00:03:10,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-29 00:03:10,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,043 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-11-29 00:03:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-29 00:03:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-29 00:03:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-11-29 00:03:10,083 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,083 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,083 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:10,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-11-29 00:03:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,088 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2018-11-29 00:03:10,088 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 [2018-11-29 00:03:10,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-11-29 00:03:10,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-11-29 00:03:10,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:10,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,342 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:10,346 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-29 00:03:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:10,557 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-29 00:03:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:10,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-11-29 00:03:10,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-11-29 00:03:10,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-29 00:03:10,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-29 00:03:10,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,569 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-11-29 00:03:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-29 00:03:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-29 00:03:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-29 00:03:10,579 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,579 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,579 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:10,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-11-29 00:03:10,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,584 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,584 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,585 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2018-11-29 00:03:10,585 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 [2018-11-29 00:03:10,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-11-29 00:03:10,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:10,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:10,745 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 [2018-11-29 00:03:10,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:10,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-29 00:03:10,795 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-11-29 00:03:10,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,046 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,047 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:11,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:11,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,155 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 [2018-11-29 00:03:11,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,164 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) [2018-11-29 00:03:11,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,186 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,191 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 [2018-11-29 00:03:11,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,212 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 [2018-11-29 00:03:11,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:11,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,176 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:12,179 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:12,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:12,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:12,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:12,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:12,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:12,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:12,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:12,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:12,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:12,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:12,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:12,305 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:12,306 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 [2018-11-29 00:03:12,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,313 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 [2018-11-29 00:03:12,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,317 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 [2018-11-29 00:03:12,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:12,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:12,330 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:12,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:12,330 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:12,330 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:12,331 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-29 00:03:12,331 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:12,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:12,650 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 [2018-11-29 00:03:12,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-29 00:03:13,149 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. [2018-11-29 00:03:13,152 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 [2018-11-29 00:03:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-29 00:03:13,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-29 00:03:13,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-11-29 00:03:13,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-11-29 00:03:13,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-11-29 00:03:13,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-11-29 00:03:13,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-29 00:03:13,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:03:13,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,173 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-11-29 00:03:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-11-29 00:03:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-29 00:03:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-11-29 00:03:13,193 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-11-29 00:03:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:03:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:03:13,194 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-11-29 00:03:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:13,414 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-11-29 00:03:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:03:13,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-11-29 00:03:13,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-11-29 00:03:13,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:03:13,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:03:13,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,439 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-11-29 00:03:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-11-29 00:03:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-29 00:03:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-11-29 00:03:13,457 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,457 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,457 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:13,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-11-29 00:03:13,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:13,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:13,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,466 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,466 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-11-29 00:03:13,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-29 00:03:13,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:13,620 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 [2018-11-29 00:03:13,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-29 00:03:14,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-11-29 00:03:14,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-11-29 00:03:14,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-29 00:03:14,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,181 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 [2018-11-29 00:03:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:03:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:03:14,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-29 00:03:14,263 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:14,264 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-29 00:03:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:14,364 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-11-29 00:03:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:14,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-11-29 00:03:14,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-11-29 00:03:14,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-29 00:03:14,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-29 00:03:14,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,378 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-11-29 00:03:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-11-29 00:03:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-29 00:03:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-29 00:03:14,394 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,394 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,394 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:14,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-11-29 00:03:14,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:14,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,402 INFO L794 eck$LassoCheckResult]: Stem: 1915#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1878#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1884#fibo1ENTRY ~n := #in~n; 1921#L8 assume !(~n < 1); 1877#L10 assume !(1 == ~n); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1898#fibo2ENTRY ~n := #in~n; 1919#L18 assume !(~n < 1); 1992#L20 assume !(1 == ~n); 1903#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1944#L10 assume !(1 == ~n); 1867#L13 call #t~ret0 := fibo2(~n - 1);< 1942#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1957#L20 assume 1 == ~n;#res := 1; 1872#fibo2FINAL assume true; 1873#fibo2EXIT >#49#return; 1868#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1925#L18 assume !(~n < 1); 1923#L20 assume !(1 == ~n); 1866#L23 call #t~ret2 := fibo1(~n - 1);< 1869#fibo1ENTRY ~n := #in~n; 1946#L8 assume !(~n < 1); 1953#L10 assume 1 == ~n;#res := 1; 1954#fibo1FINAL assume true; 1947#fibo1EXIT >#45#return; 1875#L23-1 call #t~ret3 := fibo1(~n - 2);< 1883#fibo1ENTRY ~n := #in~n; 1943#L8 assume !(~n < 1); 1940#L10 assume !(1 == ~n); 1882#L13 call #t~ret0 := fibo2(~n - 1);< 1936#fibo2ENTRY ~n := #in~n; 1934#L18 assume !(~n < 1); 1929#L20 assume 1 == ~n;#res := 1; 1930#fibo2FINAL assume true; 1920#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#45#return; 1975#L23-1 call #t~ret3 := fibo1(~n - 2);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume ~n < 1;#res := 0; 1996#fibo2FINAL assume true; 1999#fibo2EXIT >#51#return; 1973#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1997#fibo1FINAL assume true; 1989#fibo1EXIT >#47#return; 1988#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1978#fibo2FINAL assume true; 1972#fibo2EXIT >#49#return; 1916#L13-1 [2018-11-29 00:03:14,402 INFO L796 eck$LassoCheckResult]: Loop: 1916#L13-1 call #t~ret1 := fibo2(~n - 2);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1977#L23 call #t~ret2 := fibo1(~n - 1);< 1985#fibo1ENTRY ~n := #in~n; 1983#L8 assume !(~n < 1); 1980#L10 assume !(1 == ~n); 1917#L13 call #t~ret0 := fibo2(~n - 1);< 1902#fibo2ENTRY ~n := #in~n; 1918#L18 assume !(~n < 1); 1994#L20 assume 1 == ~n;#res := 1; 1995#fibo2FINAL assume true; 1987#fibo2EXIT >#49#return; 1916#L13-1 [2018-11-29 00:03:14,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-11-29 00:03:14,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-29 00:03:14,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,626 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 [2018-11-29 00:03:14,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:14,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:14,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:14,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-29 00:03:14,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-11-29 00:03:14,845 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-11-29 00:03:14,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,212 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-29 00:03:15,224 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,224 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:15,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:15,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:15,403 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 [2018-11-29 00:03:15,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,420 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 [2018-11-29 00:03:15,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,454 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 [2018-11-29 00:03:15,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,514 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 [2018-11-29 00:03:15,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,537 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,537 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 [2018-11-29 00:03:15,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,564 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 [2018-11-29 00:03:15,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,585 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 [2018-11-29 00:03:15,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:15,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:17,101 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:17,103 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:17,103 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:17,103 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:17,103 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:17,103 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:17,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:17,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:17,104 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:17,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:17,104 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:17,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:17,330 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:17,330 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 [2018-11-29 00:03:17,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,334 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 [2018-11-29 00:03:17,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,341 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 [2018-11-29 00:03:17,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,344 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 [2018-11-29 00:03:17,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,346 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 [2018-11-29 00:03:17,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,349 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 [2018-11-29 00:03:17,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,351 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 [2018-11-29 00:03:17,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:17,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:17,360 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:17,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:17,360 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:17,360 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:17,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-29 00:03:17,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:17,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:17,742 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 [2018-11-29 00:03:17,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:18,199 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. [2018-11-29 00:03:18,204 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 [2018-11-29 00:03:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-29 00:03:18,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:18,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:18,206 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:18,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:19,733 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 [2018-11-29 00:03:19,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:20,300 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. [2018-11-29 00:03:20,302 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 [2018-11-29 00:03:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-29 00:03:20,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:20,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,305 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:20,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:20,948 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 [2018-11-29 00:03:20,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:21,427 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. [2018-11-29 00:03:21,431 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 [2018-11-29 00:03:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-29 00:03:21,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:21,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-11-29 00:03:21,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-11-29 00:03:21,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-11-29 00:03:21,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-29 00:03:21,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-11-29 00:03:21,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-11-29 00:03:21,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-11-29 00:03:21,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:21,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,491 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-11-29 00:03:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-11-29 00:03:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-29 00:03:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-11-29 00:03:21,586 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-11-29 00:03:21,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:03:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:03:21,587 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2018-11-29 00:03:22,016 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:23,043 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:23,947 INFO L93 Difference]: Finished difference Result 416 states and 562 transitions. [2018-11-29 00:03:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:23,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 562 transitions. [2018-11-29 00:03:23,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:23,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 367 states and 504 transitions. [2018-11-29 00:03:23,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-29 00:03:23,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2018-11-29 00:03:23,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 504 transitions. [2018-11-29 00:03:23,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:23,961 INFO L705 BuchiCegarLoop]: Abstraction has 367 states and 504 transitions. [2018-11-29 00:03:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 504 transitions. [2018-11-29 00:03:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-11-29 00:03:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-29 00:03:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2018-11-29 00:03:23,978 INFO L728 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-11-29 00:03:23,978 INFO L608 BuchiCegarLoop]: Abstraction has 332 states and 444 transitions. [2018-11-29 00:03:23,978 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:23,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 444 transitions. [2018-11-29 00:03:23,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:23,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:23,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:23,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:23,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2018-11-29 00:03:23,987 INFO L794 eck$LassoCheckResult]: Stem: 8098#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8064#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8065#fibo1ENTRY ~n := #in~n; 8160#L8 assume !(~n < 1); 8155#L10 assume !(1 == ~n); 8135#L13 call #t~ret0 := fibo2(~n - 1);< 8152#fibo2ENTRY ~n := #in~n; 8169#L18 assume !(~n < 1); 8134#L20 assume !(1 == ~n); 8136#L23 call #t~ret2 := fibo1(~n - 1);< 8164#fibo1ENTRY ~n := #in~n; 8161#L8 assume !(~n < 1); 8156#L10 assume !(1 == ~n); 8035#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8162#L8 assume !(~n < 1); 8157#L10 assume !(1 == ~n); 8036#L13 call #t~ret0 := fibo2(~n - 1);< 8143#fibo2ENTRY ~n := #in~n; 8137#L18 assume !(~n < 1); 8138#L20 assume !(1 == ~n); 8034#L23 call #t~ret2 := fibo1(~n - 1);< 8037#fibo1ENTRY ~n := #in~n; 8165#L8 assume !(~n < 1); 8296#L10 assume 1 == ~n;#res := 1; 8292#fibo1FINAL assume true; 8206#fibo1EXIT >#45#return; 8202#L23-1 call #t~ret3 := fibo1(~n - 2);< 8203#fibo1ENTRY ~n := #in~n; 8208#L8 assume ~n < 1;#res := 0; 8205#fibo1FINAL assume true; 8201#fibo1EXIT >#47#return; 8199#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8198#fibo2FINAL assume true; 8194#fibo2EXIT >#49#return; 8129#L13-1 [2018-11-29 00:03:23,988 INFO L796 eck$LassoCheckResult]: Loop: 8129#L13-1 call #t~ret1 := fibo2(~n - 2);< 8092#fibo2ENTRY ~n := #in~n; 8131#L18 assume !(~n < 1); 8130#L20 assume !(1 == ~n); 8091#L23 call #t~ret2 := fibo1(~n - 1);< 8126#fibo1ENTRY ~n := #in~n; 8125#L8 assume !(~n < 1); 8121#L10 assume !(1 == ~n); 8123#L13 call #t~ret0 := fibo2(~n - 1);< 8196#fibo2ENTRY ~n := #in~n; 8246#L18 assume !(~n < 1); 8245#L20 assume !(1 == ~n); 8084#L23 call #t~ret2 := fibo1(~n - 1);< 8262#fibo1ENTRY ~n := #in~n; 8312#L8 assume !(~n < 1); 8313#L10 assume 1 == ~n;#res := 1; 8048#fibo1FINAL assume true; 8338#fibo1EXIT >#45#return; 8045#L23-1 call #t~ret3 := fibo1(~n - 2);< 8060#fibo1ENTRY ~n := #in~n; 8324#L8 assume ~n < 1;#res := 0; 8311#fibo1FINAL assume true; 8255#fibo1EXIT >#47#return; 8251#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8248#fibo2FINAL assume true; 8195#fibo2EXIT >#49#return; 8187#L13-1 call #t~ret1 := fibo2(~n - 2);< 8188#fibo2ENTRY ~n := #in~n; 8247#L18 assume ~n < 1;#res := 0; 8241#fibo2FINAL assume true; 8238#fibo2EXIT >#51#return; 8181#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8177#fibo1FINAL assume true; 8174#fibo1EXIT >#45#return; 8149#L23-1 call #t~ret3 := fibo1(~n - 2);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume !(1 == ~n); 8150#L23 call #t~ret2 := fibo1(~n - 1);< 8163#fibo1ENTRY ~n := #in~n; 8158#L8 assume !(~n < 1); 8153#L10 assume !(1 == ~n); 8145#L13 call #t~ret0 := fibo2(~n - 1);< 8151#fibo2ENTRY ~n := #in~n; 8168#L18 assume !(~n < 1); 8166#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#45#return; 8192#L23-1 call #t~ret3 := fibo1(~n - 2);< 8197#fibo1ENTRY ~n := #in~n; 8225#L8 assume !(~n < 1); 8217#L10 assume !(1 == ~n); 8218#L13 call #t~ret0 := fibo2(~n - 1);< 8224#fibo2ENTRY ~n := #in~n; 8235#L18 assume !(~n < 1); 8233#L20 assume 1 == ~n;#res := 1; 8167#fibo2FINAL assume true; 8220#fibo2EXIT >#49#return; 8215#L13-1 call #t~ret1 := fibo2(~n - 2);< 8216#fibo2ENTRY ~n := #in~n; 8232#L18 assume ~n < 1;#res := 0; 8219#fibo2FINAL assume true; 8214#fibo2EXIT >#51#return; 8213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8210#fibo1FINAL assume true; 8207#fibo1EXIT >#47#return; 8193#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8189#fibo2FINAL assume true; 8144#fibo2EXIT >#49#return; 8129#L13-1 [2018-11-29 00:03:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 1 times [2018-11-29 00:03:23,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:24,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:24,533 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 [2018-11-29 00:03:24,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:24,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:24,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-29 00:03:24,598 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:24,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1570424754, now seen corresponding path program 1 times [2018-11-29 00:03:24,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-29 00:03:24,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:24,742 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 [2018-11-29 00:03:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:24,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-29 00:03:25,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:25,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-29 00:03:25,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:03:25,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:03:25,045 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. cyclomatic complexity: 116 Second operand 17 states. [2018-11-29 00:03:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:25,671 INFO L93 Difference]: Finished difference Result 418 states and 600 transitions. [2018-11-29 00:03:25,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-29 00:03:25,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 600 transitions. [2018-11-29 00:03:25,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:25,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 415 states and 596 transitions. [2018-11-29 00:03:25,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2018-11-29 00:03:25,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-11-29 00:03:25,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 596 transitions. [2018-11-29 00:03:25,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:25,685 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 596 transitions. [2018-11-29 00:03:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 596 transitions. [2018-11-29 00:03:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 393. [2018-11-29 00:03:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:03:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 558 transitions. [2018-11-29 00:03:25,702 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-11-29 00:03:25,702 INFO L608 BuchiCegarLoop]: Abstraction has 393 states and 558 transitions. [2018-11-29 00:03:25,702 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:03:25,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 558 transitions. [2018-11-29 00:03:25,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:25,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:25,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:25,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:25,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 10, 9, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1] [2018-11-29 00:03:25,711 INFO L794 eck$LassoCheckResult]: Stem: 9227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9189#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9190#fibo1ENTRY ~n := #in~n; 9381#L8 assume !(~n < 1); 9366#L10 assume !(1 == ~n); 9367#L13 call #t~ret0 := fibo2(~n - 1);< 9379#fibo2ENTRY ~n := #in~n; 9378#L18 assume !(~n < 1); 9377#L20 assume !(1 == ~n); 9214#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9239#L10 assume !(1 == ~n); 9213#L13 call #t~ret0 := fibo2(~n - 1);< 9215#fibo2ENTRY ~n := #in~n; 9235#L18 assume !(~n < 1); 9242#L20 assume !(1 == ~n); 9243#L23 call #t~ret2 := fibo1(~n - 1);< 9396#fibo1ENTRY ~n := #in~n; 9458#L8 assume !(~n < 1); 9457#L10 assume !(1 == ~n); 9187#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9373#L8 assume !(~n < 1); 9194#L10 assume !(1 == ~n); 9186#L13 call #t~ret0 := fibo2(~n - 1);< 9363#fibo2ENTRY ~n := #in~n; 9530#L18 assume !(~n < 1); 9529#L20 assume !(1 == ~n); 9185#L23 call #t~ret2 := fibo1(~n - 1);< 9188#fibo1ENTRY ~n := #in~n; 9376#L8 assume !(~n < 1); 9482#L10 assume 1 == ~n;#res := 1; 9483#fibo1FINAL assume true; 9494#fibo1EXIT >#45#return; 9415#L23-1 call #t~ret3 := fibo1(~n - 2);< 9469#fibo1ENTRY ~n := #in~n; 9471#L8 assume ~n < 1;#res := 0; 9470#fibo1FINAL assume true; 9467#fibo1EXIT >#47#return; 9465#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9461#fibo2FINAL assume true; 9362#fibo2EXIT >#49#return; 9297#L13-1 [2018-11-29 00:03:25,711 INFO L796 eck$LassoCheckResult]: Loop: 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume !(1 == ~n); 9198#L13 call #t~ret0 := fibo2(~n - 1);< 9277#fibo2ENTRY ~n := #in~n; 9323#L18 assume !(~n < 1); 9320#L20 assume !(1 == ~n); 9256#L23 call #t~ret2 := fibo1(~n - 1);< 9274#fibo1ENTRY ~n := #in~n; 9272#L8 assume !(~n < 1); 9270#L10 assume 1 == ~n;#res := 1; 9271#fibo1FINAL assume true; 9326#fibo1EXIT >#45#return; 9203#L23-1 call #t~ret3 := fibo1(~n - 2);< 9204#fibo1ENTRY ~n := #in~n; 9329#L8 assume ~n < 1;#res := 0; 9273#fibo1FINAL assume true; 9310#fibo1EXIT >#47#return; 9206#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9197#fibo2FINAL assume true; 9200#fibo2EXIT >#49#return; 9220#L13-1 call #t~ret1 := fibo2(~n - 2);< 9222#fibo2ENTRY ~n := #in~n; 9401#L18 assume !(~n < 1); 9299#L20 assume !(1 == ~n); 9221#L23 call #t~ret2 := fibo1(~n - 1);< 9290#fibo1ENTRY ~n := #in~n; 9291#L8 assume !(~n < 1); 9445#L10 assume 1 == ~n;#res := 1; 9446#fibo1FINAL assume true; 9486#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#51#return; 9361#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9523#fibo1FINAL assume true; 9392#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume !(1 == ~n); 9370#L23 call #t~ret2 := fibo1(~n - 1);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume 1 == ~n;#res := 1; 9372#fibo1FINAL assume true; 9487#fibo1EXIT >#45#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9419#fibo1ENTRY ~n := #in~n; 9491#L8 assume !(~n < 1); 9488#L10 assume !(1 == ~n); 9442#L13 call #t~ret0 := fibo2(~n - 1);< 9444#fibo2ENTRY ~n := #in~n; 9463#L18 assume !(~n < 1); 9459#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9412#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9385#fibo2FINAL assume true; 9357#fibo2EXIT >#49#return; 9297#L13-1 call #t~ret1 := fibo2(~n - 2);< 9386#fibo2ENTRY ~n := #in~n; 9449#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9431#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9528#fibo1FINAL assume true; 9395#fibo1EXIT >#45#return; 9369#L23-1 call #t~ret3 := fibo1(~n - 2);< 9380#fibo1ENTRY ~n := #in~n; 9374#L8 assume !(~n < 1); 9368#L10 assume !(1 == ~n); 9358#L13 call #t~ret0 := fibo2(~n - 1);< 9365#fibo2ENTRY ~n := #in~n; 9384#L18 assume !(~n < 1); 9382#L20 assume 1 == ~n;#res := 1; 9383#fibo2FINAL assume true; 9441#fibo2EXIT >#49#return; 9429#L13-1 call #t~ret1 := fibo2(~n - 2);< 9432#fibo2ENTRY ~n := #in~n; 9438#L18 assume ~n < 1;#res := 0; 9436#fibo2FINAL assume true; 9428#fibo2EXIT >#51#return; 9421#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9418#fibo1FINAL assume true; 9414#fibo1EXIT >#47#return; 9393#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9405#fibo2FINAL assume true; 9403#fibo2EXIT >#49#return; 9297#L13-1 [2018-11-29 00:03:25,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1138675049, now seen corresponding path program 2 times [2018-11-29 00:03:25,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:25,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,080 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 [2018-11-29 00:03:26,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:26,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:26,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:26,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-11-29 00:03:26,244 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:26,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:26,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1600037258, now seen corresponding path program 2 times [2018-11-29 00:03:26,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:26,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 56 proven. 91 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-29 00:03:26,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-11-29 00:03:26,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:26,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:26,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:26,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 302 proven. 29 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-29 00:03:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-11-29 00:03:26,558 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-29 00:03:26,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-29 00:03:26,559 INFO L87 Difference]: Start difference. First operand 393 states and 558 transitions. cyclomatic complexity: 169 Second operand 23 states. [2018-11-29 00:03:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:27,232 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2018-11-29 00:03:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-29 00:03:27,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 668 transitions. [2018-11-29 00:03:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:27,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 453 states and 591 transitions. [2018-11-29 00:03:27,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2018-11-29 00:03:27,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2018-11-29 00:03:27,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 591 transitions. [2018-11-29 00:03:27,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:27,248 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 591 transitions. [2018-11-29 00:03:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 591 transitions. [2018-11-29 00:03:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 427. [2018-11-29 00:03:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-11-29 00:03:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 550 transitions. [2018-11-29 00:03:27,264 INFO L728 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-11-29 00:03:27,264 INFO L608 BuchiCegarLoop]: Abstraction has 427 states and 550 transitions. [2018-11-29 00:03:27,264 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:27,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 550 transitions. [2018-11-29 00:03:27,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:03:27,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:27,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:27,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:27,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:27,271 INFO L794 eck$LassoCheckResult]: Stem: 10746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10714#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10715#fibo1ENTRY ~n := #in~n; 10842#L8 assume !(~n < 1); 10838#L10 assume !(1 == ~n); 10833#L13 call #t~ret0 := fibo2(~n - 1);< 10834#fibo2ENTRY ~n := #in~n; 10847#L18 assume !(~n < 1); 10846#L20 assume !(1 == ~n); 10844#L23 call #t~ret2 := fibo1(~n - 1);< 10845#fibo1ENTRY ~n := #in~n; 10858#L8 assume !(~n < 1); 10857#L10 assume !(1 == ~n); 10855#L13 call #t~ret0 := fibo2(~n - 1);< 10856#fibo2ENTRY ~n := #in~n; 10871#L18 assume !(~n < 1); 10870#L20 assume !(1 == ~n); 10868#L23 call #t~ret2 := fibo1(~n - 1);< 10869#fibo1ENTRY ~n := #in~n; 10981#L8 assume !(~n < 1); 10979#L10 assume !(1 == ~n); 10975#L13 call #t~ret0 := fibo2(~n - 1);< 10977#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(1 == ~n); 10992#L23 call #t~ret2 := fibo1(~n - 1);< 10993#fibo1ENTRY ~n := #in~n; 11053#L8 assume !(~n < 1); 11050#L10 assume !(1 == ~n); 11008#L13 call #t~ret0 := fibo2(~n - 1);< 11009#fibo2ENTRY ~n := #in~n; 11014#L18 assume !(~n < 1); 11013#L20 assume 1 == ~n;#res := 1; 11012#fibo2FINAL assume true; 11007#fibo2EXIT >#49#return; 11001#L13-1 call #t~ret1 := fibo2(~n - 2);< 11002#fibo2ENTRY ~n := #in~n; 11025#L18 assume ~n < 1;#res := 0; 11024#fibo2FINAL assume true; 11000#fibo2EXIT >#51#return; 10998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10997#fibo1FINAL assume true; 10991#fibo1EXIT >#45#return; 10926#L23-1 call #t~ret3 := fibo1(~n - 2);< 10988#fibo1ENTRY ~n := #in~n; 11027#L8 assume ~n < 1;#res := 0; 11026#fibo1FINAL assume true; 10986#fibo1EXIT >#47#return; 10985#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10984#fibo2FINAL assume true; 10976#fibo2EXIT >#49#return; 10918#L13-1 call #t~ret1 := fibo2(~n - 2);< 10931#fibo2ENTRY ~n := #in~n; 10932#L18 assume ~n < 1;#res := 0; 10925#fibo2FINAL assume true; 10914#fibo2EXIT >#51#return; 10921#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11058#fibo1FINAL assume true; 10867#fibo1EXIT >#45#return; 10862#L23-1 call #t~ret3 := fibo1(~n - 2);< 10866#fibo1ENTRY ~n := #in~n; 10996#L8 assume !(~n < 1); 10994#L10 assume !(1 == ~n); 10957#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-11-29 00:03:27,272 INFO L796 eck$LassoCheckResult]: Loop: 10990#fibo2ENTRY ~n := #in~n; 11054#L18 assume !(~n < 1); 11051#L20 assume !(1 == ~n); 10929#L23 call #t~ret2 := fibo1(~n - 1);< 11017#fibo1ENTRY ~n := #in~n; 11057#L8 assume !(~n < 1); 11055#L10 assume !(1 == ~n); 10956#L13 call #t~ret0 := fibo2(~n - 1);< 10990#fibo2ENTRY [2018-11-29 00:03:27,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1911557610, now seen corresponding path program 1 times [2018-11-29 00:03:27,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:27,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-29 00:03:27,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:27,439 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 [2018-11-29 00:03:27,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 30 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-29 00:03:27,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:27,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 21 [2018-11-29 00:03:27,686 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1606542952, now seen corresponding path program 2 times [2018-11-29 00:03:27,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:27,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:27,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:27,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:27,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:27,783 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:27,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:27,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:27,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:27,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:03:27,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:27,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:27,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:27,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:27,877 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:27,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:27,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:27,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:27,885 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:27,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:27,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:27,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:27,909 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:27,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:27,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:27,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:27,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:27,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:27,990 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,034 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,034 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,080 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:28,104 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:28,129 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:28,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:28,174 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:28,176 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:28,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:28,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:28,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:28,176 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:28,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:28,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:28,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:28,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:03:28,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:28,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:28,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:28,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:28,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:28,258 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 [2018-11-29 00:03:28,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,267 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 [2018-11-29 00:03:28,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,271 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 [2018-11-29 00:03:28,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,276 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 [2018-11-29 00:03:28,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,282 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 [2018-11-29 00:03:28,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,284 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 [2018-11-29 00:03:28,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,291 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 [2018-11-29 00:03:28,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,293 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 [2018-11-29 00:03:28,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:28,300 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 [2018-11-29 00:03:28,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:28,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:28,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:28,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:28,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:28,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:28,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:28,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:28,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:28,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:28,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:28,311 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:28,311 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:28,311 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-29 00:03:28,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:28,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:28,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,017 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:03:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:29,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:29,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:29,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-11-29 00:03:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-29 00:03:29,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:29,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:29,242 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:29,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:29,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:29,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:29,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 452 states and 575 transitions. Complement of second has 15 states. [2018-11-29 00:03:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-29 00:03:29,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:29,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:29,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:29,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:30,400 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:30,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-29 00:03:31,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 550 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 739 states and 924 transitions. Complement of second has 27 states. [2018-11-29 00:03:31,550 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 [2018-11-29 00:03:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-29 00:03:31,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:31,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 72 letters. Loop has 8 letters. [2018-11-29 00:03:31,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 16 letters. [2018-11-29 00:03:31,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 739 states and 924 transitions. [2018-11-29 00:03:31,568 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 739 states to 0 states and 0 transitions. [2018-11-29 00:03:31,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:31,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:31,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:31,570 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,570 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-29 00:03:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-11-29 00:03:31,570 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 21 states. [2018-11-29 00:03:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:31,571 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:31,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:31,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:31,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:31,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:31,578 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,578 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,578 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:31,578 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:31,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:31,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:31,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:31,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:31 BoogieIcfgContainer [2018-11-29 00:03:31,597 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:31,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:31,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:31,598 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:31,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/4) ... [2018-11-29 00:03:31,606 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:31,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:31,607 INFO L168 Benchmark]: Toolchain (without parser) took 25689.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -354.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,610 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.86 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,611 INFO L168 Benchmark]: Boogie Preprocessor took 21.24 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,612 INFO L168 Benchmark]: RCFGBuilder took 464.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,612 INFO L168 Benchmark]: BuchiAutomizer took 24842.87 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:31,619 INFO L168 Benchmark]: Witness Printer took 8.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:31,628 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.86 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.24 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 464.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24842.87 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.7s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 11.0s. Construction of modules took 4.3s. Büchi inclusion checks took 8.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 427 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 305 SDtfs, 775 SDslu, 899 SDs, 0 SdLazy, 2034 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...