./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer --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.23-1dbac8b [2018-11-10 12:07:52,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:07:52,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:07:52,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:07:52,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:07:52,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:07:52,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:07:52,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:07:52,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:07:52,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:07:52,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:07:52,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:07:52,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:07:52,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:07:52,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:07:52,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:07:52,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:07:52,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:07:52,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:07:52,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:07:52,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:07:52,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:07:52,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:07:52,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:07:52,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:07:52,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:07:52,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:07:52,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:07:52,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:07:52,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:07:52,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:07:52,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:07:52,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:07:52,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:07:52,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:07:52,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:07:52,091 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:07:52,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:07:52,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:07:52,105 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:07:52,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:07:52,105 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:07:52,105 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:07:52,105 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:07:52,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:07:52,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:07:52,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:07:52,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:07:52,108 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:07:52,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:07:52,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:07:52,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:07:52,108 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:07:52,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:07:52,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:07:52,109 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:07:52,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:07:52,110 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer 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-10 12:07:52,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:07:52,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:07:52,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:07:52,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:07:52,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:07:52,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-10 12:07:52,190 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/data/30c550a4c/bb443e6c7f774ad3b75c9bfb6fad02bf/FLAG9042ccf1b [2018-11-10 12:07:52,530 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:07:52,530 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/sv-benchmarks/c/recursive-simple/fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-10 12:07:52,534 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/data/30c550a4c/bb443e6c7f774ad3b75c9bfb6fad02bf/FLAG9042ccf1b [2018-11-10 12:07:52,543 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/data/30c550a4c/bb443e6c7f774ad3b75c9bfb6fad02bf [2018-11-10 12:07:52,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:07:52,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:07:52,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:07:52,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:07:52,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:07:52,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52, skipping insertion in model container [2018-11-10 12:07:52,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:07:52,570 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:07:52,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:07:52,676 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:07:52,687 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:07:52,697 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:07:52,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52 WrapperNode [2018-11-10 12:07:52,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:07:52,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:07:52,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:07:52,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:07:52,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:07:52,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:07:52,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:07:52,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:07:52,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... [2018-11-10 12:07:52,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:07:52,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:07:52,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:07:52,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:07:52,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:07:52,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:07:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 12:07:52,819 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 12:07:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 12:07:52,819 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 12:07:52,922 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:07:52,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:52 BoogieIcfgContainer [2018-11-10 12:07:52,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:07:52,923 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:07:52,924 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:07:52,927 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:07:52,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:52,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:07:52" (1/3) ... [2018-11-10 12:07:52,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258d971d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:07:52, skipping insertion in model container [2018-11-10 12:07:52,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:52,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:52" (2/3) ... [2018-11-10 12:07:52,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258d971d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:07:52, skipping insertion in model container [2018-11-10 12:07:52,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:07:52,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:52" (3/3) ... [2018-11-10 12:07:52,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_true-unreach-call_true-termination.c [2018-11-10 12:07:52,968 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:07:52,969 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:07:52,969 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:07:52,969 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:07:52,969 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:07:52,969 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:07:52,969 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:07:52,969 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:07:52,969 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:07:52,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 12:07:53,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:53,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:53,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:53,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 12:07:53,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:53,007 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:07:53,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 12:07:53,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:53,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:53,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:53,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 12:07:53,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:53,014 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17#L37true call main_#t~ret4 := fibo1(main_~x~0);< 25#fibo1ENTRYtrue [2018-11-10 12:07:53,015 INFO L795 eck$LassoCheckResult]: Loop: 25#fibo1ENTRYtrue ~n := #in~n; 13#L8true assume !(~n < 1); 4#L10true assume !(~n == 1); 19#L13true call #t~ret0 := fibo2(~n - 1);< 11#fibo2ENTRYtrue ~n := #in~n; 28#L18true assume !(~n < 1); 26#L20true assume !(~n == 1); 3#L23true call #t~ret2 := fibo1(~n - 1);< 25#fibo1ENTRYtrue [2018-11-10 12:07:53,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2018-11-10 12:07:53,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:53,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:53,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2018-11-10 12:07:53,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:53,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:53,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:53,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2018-11-10 12:07:53,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:53,266 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:53,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:53,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:53,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:53,268 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:07:53,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:53,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:53,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:53,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 12:07:53,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:53,269 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:53,282 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-10 12:07:53,287 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-10 12:07:53,290 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-10 12:07:53,292 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-10 12:07:53,294 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-10 12:07:53,296 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-10 12:07:53,298 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-10 12:07:53,306 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-10 12:07:53,307 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-10 12:07:53,309 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-10 12:07:53,380 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:53,381 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,404 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,404 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,430 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,430 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,454 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,454 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,502 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,502 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:53,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,525 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,525 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:53,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,547 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,547 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:53,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,565 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,567 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,567 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,587 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,587 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,606 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:53,606 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:53,623 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:53,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:07:53,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:53,697 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:07:53,698 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:53,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:53,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:53,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:53,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:53,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:53,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:53,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:53,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 12:07:53,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:53,699 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:53,700 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-10 12:07:53,702 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-10 12:07:53,703 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-10 12:07:53,704 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-10 12:07:53,705 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-10 12:07:53,708 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-10 12:07:53,714 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-10 12:07:53,715 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-10 12:07:53,717 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-10 12:07:53,727 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-10 12:07:53,767 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:53,771 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:53,772 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-10 12:07:53,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,779 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-10 12:07:53,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,783 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-10 12:07:53,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,787 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-10 12:07:53,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,791 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-10 12:07:53,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,794 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-10 12:07:53,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,798 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-10 12:07:53,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,801 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-10 12:07:53,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:53,805 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-10 12:07:53,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:53,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:53,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:53,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:53,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:53,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:53,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:53,812 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:53,816 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:07:53,816 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:07:53,818 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:53,818 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:07:53,819 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:53,819 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 12:07:53,820 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:07:53,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:53,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:53,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:53,955 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-10 12:07:53,968 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-10 12:07:53,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 6 states. [2018-11-10 12:07:54,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 6 states. Result 84 states and 116 transitions. Complement of second has 24 states. [2018-11-10 12:07:54,169 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-10 12:07:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:07:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-10 12:07:54,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 12:07:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 12:07:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-10 12:07:54,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:54,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2018-11-10 12:07:54,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:54,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2018-11-10 12:07:54,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 12:07:54,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 12:07:54,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2018-11-10 12:07:54,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:54,193 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-10 12:07:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2018-11-10 12:07:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-10 12:07:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 12:07:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 12:07:54,223 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 12:07:54,223 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 12:07:54,223 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:07:54,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2018-11-10 12:07:54,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:54,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:54,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:54,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:54,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:54,226 INFO L793 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 214#L37 call main_#t~ret4 := fibo1(main_~x~0);< 216#fibo1ENTRY ~n := #in~n; 228#L8 assume !(~n < 1); 213#L10 assume !(~n == 1); 205#L13 call #t~ret0 := fibo2(~n - 1);< 221#fibo2ENTRY ~n := #in~n; 248#L18 assume !(~n < 1); 249#L20 assume !(~n == 1); 200#L23 call #t~ret2 := fibo1(~n - 1);< 203#fibo1ENTRY ~n := #in~n; 229#L8 assume ~n < 1;#res := 0; 212#fibo1FINAL assume true; 219#fibo1EXIT >#46#return; 215#L23-1 [2018-11-10 12:07:54,227 INFO L795 eck$LassoCheckResult]: Loop: 215#L23-1 call #t~ret3 := fibo1(~n - 2);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume !(~n < 1); 242#L10 assume !(~n == 1); 198#L13 call #t~ret0 := fibo2(~n - 1);< 222#fibo2ENTRY ~n := #in~n; 241#L18 assume !(~n < 1); 237#L20 assume !(~n == 1); 196#L23 call #t~ret2 := fibo1(~n - 1);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume ~n < 1;#res := 0; 224#fibo1FINAL assume true; 225#fibo1EXIT >#46#return; 215#L23-1 [2018-11-10 12:07:54,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2018-11-10 12:07:54,227 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:54,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:54,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:54,300 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-10 12:07:54,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:07:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:07:54,304 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:07:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2018-11-10 12:07:54,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:54,356 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-10 12:07:54,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:07:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:07:54,357 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:07:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:07:54,360 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-10 12:07:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:54,460 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-10 12:07:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:07:54,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-10 12:07:54,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:54,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2018-11-10 12:07:54,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 12:07:54,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 12:07:54,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2018-11-10 12:07:54,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:54,465 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-10 12:07:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2018-11-10 12:07:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-10 12:07:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 12:07:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-11-10 12:07:54,471 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 12:07:54,471 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 12:07:54,471 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:07:54,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2018-11-10 12:07:54,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:07:54,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:54,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:54,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:54,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:54,474 INFO L793 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 343#L37 call main_#t~ret4 := fibo1(main_~x~0);< 344#fibo1ENTRY ~n := #in~n; 372#L8 assume !(~n < 1); 348#L10 assume !(~n == 1); 339#L13 call #t~ret0 := fibo2(~n - 1);< 358#fibo2ENTRY ~n := #in~n; 388#L18 assume !(~n < 1); 389#L20 assume !(~n == 1); 337#L23 call #t~ret2 := fibo1(~n - 1);< 342#fibo1ENTRY ~n := #in~n; 367#L8 assume !(~n < 1); 383#L10 assume ~n == 1;#res := 1; 382#fibo1FINAL assume true; 378#fibo1EXIT >#46#return; 346#L23-1 [2018-11-10 12:07:54,474 INFO L795 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume !(~n == 1); 335#L13 call #t~ret0 := fibo2(~n - 1);< 381#fibo2ENTRY ~n := #in~n; 386#L18 assume !(~n < 1); 376#L20 assume !(~n == 1); 333#L23 call #t~ret2 := fibo1(~n - 1);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume ~n == 1;#res := 1; 347#fibo1FINAL assume true; 362#fibo1EXIT >#46#return; 346#L23-1 [2018-11-10 12:07:54,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2018-11-10 12:07:54,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:54,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:54,536 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-10 12:07:54,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:54,536 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:54,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:54,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:54,556 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-10 12:07:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:07:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 12:07:54,572 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:07:54,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2018-11-10 12:07:54,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:54,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:54,675 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:54,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:54,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:54,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:54,676 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:07:54,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:54,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:54,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:54,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 12:07:54,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:54,676 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:54,677 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-10 12:07:54,678 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-10 12:07:54,679 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-10 12:07:54,683 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-10 12:07:54,684 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-10 12:07:54,686 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-10 12:07:54,687 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-10 12:07:54,688 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-10 12:07:54,689 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-10 12:07:54,715 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:54,715 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:54,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:54,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:54,719 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:54,719 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:54,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:54,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:54,738 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:54,738 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:54,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:54,757 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:54,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:07:54,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:55,658 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:07:55,660 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:55,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:55,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:55,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:55,660 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:55,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:55,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:55,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:55,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 12:07:55,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:55,660 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:55,662 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-10 12:07:55,664 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-10 12:07:55,665 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-10 12:07:55,669 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-10 12:07:55,671 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-10 12:07:55,672 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-10 12:07:55,673 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-10 12:07:55,674 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-10 12:07:55,677 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-10 12:07:55,709 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:55,709 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:55,709 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-10 12:07:55,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:55,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:55,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:55,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:55,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:55,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:55,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:55,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:55,716 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-10 12:07:55,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:55,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:55,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:55,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:55,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:55,719 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-10 12:07:55,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:55,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:55,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:55,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:55,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:55,724 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:55,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:07:55,728 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:07:55,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:55,729 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:07:55,729 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:55,729 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-10 12:07:55,729 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:07:55,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:55,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:55,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:55,857 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-10 12:07:55,858 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-10 12:07:55,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-10 12:07:56,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 191 states and 263 transitions. Complement of second has 26 states. [2018-11-10 12:07:56,036 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-10 12:07:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:07:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-10 12:07:56,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-10 12:07:56,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:56,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 30 letters. Loop has 14 letters. [2018-11-10 12:07:56,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:56,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 28 letters. [2018-11-10 12:07:56,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:56,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. [2018-11-10 12:07:56,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 12:07:56,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2018-11-10 12:07:56,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 12:07:56,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 12:07:56,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2018-11-10 12:07:56,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:56,048 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2018-11-10 12:07:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2018-11-10 12:07:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-10 12:07:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 12:07:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2018-11-10 12:07:56,060 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2018-11-10 12:07:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:07:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:07:56,061 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand 9 states. [2018-11-10 12:07:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:56,144 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2018-11-10 12:07:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:07:56,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 244 transitions. [2018-11-10 12:07:56,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 12:07:56,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 240 transitions. [2018-11-10 12:07:56,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-10 12:07:56,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-10 12:07:56,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 240 transitions. [2018-11-10 12:07:56,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:56,151 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 240 transitions. [2018-11-10 12:07:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 240 transitions. [2018-11-10 12:07:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-11-10 12:07:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 12:07:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2018-11-10 12:07:56,160 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 12:07:56,160 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 12:07:56,160 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:07:56,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 225 transitions. [2018-11-10 12:07:56,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 12:07:56,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:56,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:56,166 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, 1] [2018-11-10 12:07:56,166 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-10 12:07:56,166 INFO L793 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1154#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1155#fibo1ENTRY ~n := #in~n; 1219#L8 assume !(~n < 1); 1218#L10 assume !(~n == 1); 1132#L13 call #t~ret0 := fibo2(~n - 1);< 1164#fibo2ENTRY ~n := #in~n; 1281#L18 assume !(~n < 1); 1280#L20 assume !(~n == 1); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(~n == 1); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume !(~n < 1); 1213#L20 assume !(~n == 1); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(~n == 1); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume ~n < 1;#res := 0; 1211#fibo2FINAL assume true; 1207#fibo2EXIT >#50#return; 1129#L13-1 call #t~ret1 := fibo2(~n - 2);< 1168#fibo2ENTRY ~n := #in~n; 1178#L18 assume !(~n < 1); 1185#L20 assume !(~n == 1); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1217#L8 assume !(~n < 1); 1223#L10 assume ~n == 1;#res := 1; 1222#fibo1FINAL assume true; 1220#fibo1EXIT >#46#return; 1204#L23-1 call #t~ret3 := fibo1(~n - 2);< 1136#fibo1ENTRY ~n := #in~n; 1210#L8 assume !(~n < 1); 1206#L10 assume !(~n == 1); 1134#L13 call #t~ret0 := fibo2(~n - 1);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume ~n < 1;#res := 0; 1201#fibo2FINAL assume true; 1209#fibo2EXIT >#50#return; 1135#L13-1 call #t~ret1 := fibo2(~n - 2);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume !(~n < 1); 1196#L20 assume ~n == 1;#res := 1; 1137#fibo2FINAL assume true; 1138#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 12:07:56,167 INFO L795 eck$LassoCheckResult]: Loop: 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 12:07:56,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 376035563, now seen corresponding path program 1 times [2018-11-10 12:07:56,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:56,211 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-10 12:07:56,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:56,212 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:56,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:56,327 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-10 12:07:56,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:07:56,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-11-10 12:07:56,345 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:07:56,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash 36254641, now seen corresponding path program 1 times [2018-11-10 12:07:56,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:56,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:56,379 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-10 12:07:56,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:56,380 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:56,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:56,416 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-10 12:07:56,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:07:56,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 12:07:56,433 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:07:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:07:56,433 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-10 12:07:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:56,469 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2018-11-10 12:07:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:07:56,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 236 transitions. [2018-11-10 12:07:56,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 12:07:56,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 172 states and 222 transitions. [2018-11-10 12:07:56,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 12:07:56,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 12:07:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 222 transitions. [2018-11-10 12:07:56,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:56,479 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 222 transitions. [2018-11-10 12:07:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 222 transitions. [2018-11-10 12:07:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2018-11-10 12:07:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 12:07:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2018-11-10 12:07:56,490 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 12:07:56,491 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 12:07:56,491 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:07:56,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 206 transitions. [2018-11-10 12:07:56,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 12:07:56,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:56,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:56,496 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, 1] [2018-11-10 12:07:56,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:07:56,496 INFO L793 eck$LassoCheckResult]: Stem: 1933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1928#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1908#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1910#fibo1ENTRY ~n := #in~n; 1941#L8 assume !(~n < 1); 1907#L10 assume !(~n == 1); 1909#L13 call #t~ret0 := fibo2(~n - 1);< 1918#fibo2ENTRY ~n := #in~n; 2020#L18 assume !(~n < 1); 2019#L20 assume !(~n == 1); 1923#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1973#L8 assume !(~n < 1); 1971#L10 assume !(~n == 1); 1889#L13 call #t~ret0 := fibo2(~n - 1);< 1968#fibo2ENTRY ~n := #in~n; 1974#L18 assume !(~n < 1); 1972#L20 assume !(~n == 1); 1888#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1973#L8 assume !(~n < 1); 1971#L10 assume !(~n == 1); 1889#L13 call #t~ret0 := fibo2(~n - 1);< 1968#fibo2ENTRY ~n := #in~n; 1974#L18 assume !(~n < 1); 1972#L20 assume ~n == 1;#res := 1; 1970#fibo2FINAL assume true; 1967#fibo2EXIT >#50#return; 1890#L13-1 call #t~ret1 := fibo2(~n - 2);< 1924#fibo2ENTRY ~n := #in~n; 1937#L18 assume !(~n < 1); 1943#L20 assume !(~n == 1); 1888#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1975#L8 assume !(~n < 1); 1979#L10 assume ~n == 1;#res := 1; 1980#fibo1FINAL assume true; 1976#fibo1EXIT >#46#return; 1963#L23-1 call #t~ret3 := fibo1(~n - 2);< 1903#fibo1ENTRY ~n := #in~n; 1969#L8 assume !(~n < 1); 1964#L10 assume !(~n == 1); 1902#L13 call #t~ret0 := fibo2(~n - 1);< 1961#fibo2ENTRY ~n := #in~n; 1959#L18 assume !(~n < 1); 1952#L20 assume ~n == 1;#res := 1; 1953#fibo2FINAL assume true; 2004#fibo2EXIT >#50#return; 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume ~n < 1;#res := 0; 2018#fibo2FINAL assume true; 2023#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2002#fibo2FINAL assume true; 1997#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#46#return; 1999#L23-1 call #t~ret3 := fibo1(~n - 2);< 2012#fibo1ENTRY ~n := #in~n; 2031#L8 assume !(~n < 1); 2013#L10 assume !(~n == 1); 1935#L13 call #t~ret0 := fibo2(~n - 1);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume ~n == 1;#res := 1; 2015#fibo2FINAL assume true; 2003#fibo2EXIT >#50#return; 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume ~n < 1;#res := 0; 2018#fibo2FINAL assume true; 2023#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2002#fibo2FINAL assume true; 1997#fibo2EXIT >#50#return; 1934#L13-1 [2018-11-10 12:07:56,497 INFO L795 eck$LassoCheckResult]: Loop: 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume !(~n == 1); 1998#L23 call #t~ret2 := fibo1(~n - 1);< 2012#fibo1ENTRY ~n := #in~n; 2031#L8 assume !(~n < 1); 2013#L10 assume !(~n == 1); 1935#L13 call #t~ret0 := fibo2(~n - 1);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume ~n == 1;#res := 1; 2015#fibo2FINAL assume true; 2003#fibo2EXIT >#50#return; 1934#L13-1 [2018-11-10 12:07:56,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash 821073247, now seen corresponding path program 2 times [2018-11-10 12:07:56,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:56,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:56,578 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-10 12:07:56,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:56,578 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:07:56,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:07:56,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:07:56,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:56,740 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-10 12:07:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:07:56,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-11-10 12:07:56,757 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:07:56,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2018-11-10 12:07:56,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:07:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:56,853 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:56,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:56,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:56,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:56,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:07:56,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:56,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:56,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:56,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 12:07:56,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:56,854 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:56,854 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-10 12:07:56,856 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-10 12:07:56,858 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-10 12:07:56,862 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-10 12:07:56,863 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-10 12:07:56,865 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-10 12:07:56,866 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-10 12:07:56,879 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-10 12:07:56,880 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-10 12:07:56,909 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:56,909 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:56,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:56,932 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:56,932 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:56,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:56,937 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:56,937 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:56,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:56,957 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:56,957 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:56,977 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:56,979 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:56,979 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:56,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:56,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:57,000 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:57,000 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:57,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:57,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:57,021 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:07:57,021 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:57,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:07:57,041 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:57,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:07:57,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:07:57,774 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:07:57,775 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:07:57,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:07:57,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:07:57,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:07:57,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:07:57,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:07:57,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:07:57,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:07:57,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 12:07:57,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:07:57,776 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:07:57,777 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-10 12:07:57,782 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-10 12:07:57,783 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-10 12:07:57,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-10 12:07:57,787 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-10 12:07:57,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-10 12:07:57,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-10 12:07:57,796 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-10 12:07:57,798 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-10 12:07:57,833 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:07:57,833 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:07:57,834 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-10 12:07:57,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,836 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-10 12:07:57,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,843 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-10 12:07:57,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,846 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-10 12:07:57,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,848 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-10 12:07:57,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,850 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-10 12:07:57,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:07:57,852 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-10 12:07:57,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:07:57,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:07:57,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:07:57,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:07:57,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:07:57,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:07:57,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:07:57,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:07:57,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:07:57,858 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:07:57,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:07:57,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:07:57,858 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:07:57,858 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-10 12:07:57,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:07:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:57,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:57,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:58,044 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-10 12:07:58,044 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-10 12:07:58,044 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 12:07:58,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 880 states and 1168 transitions. Complement of second has 26 states. [2018-11-10 12:07:58,290 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-10 12:07:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:07:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-11-10 12:07:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 12:07:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:58,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:07:58,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:58,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:58,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:58,464 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-10 12:07:58,465 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-10 12:07:58,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 12:07:58,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 670 states and 943 transitions. Complement of second has 24 states. [2018-11-10 12:07:58,634 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-10 12:07:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:07:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-10 12:07:58,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 12:07:58,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:58,635 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:07:58,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:58,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:58,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:58,810 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-10 12:07:58,810 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-10 12:07:58,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 12:07:59,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1661 states and 2157 transitions. Complement of second has 90 states. [2018-11-10 12:07:59,063 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-10 12:07:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:07:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-11-10 12:07:59,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 12:07:59,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:59,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 97 letters. Loop has 14 letters. [2018-11-10 12:07:59,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:59,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 28 letters. [2018-11-10 12:07:59,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:07:59,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1661 states and 2157 transitions. [2018-11-10 12:07:59,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-10 12:07:59,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1661 states to 1189 states and 1644 transitions. [2018-11-10 12:07:59,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-10 12:07:59,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-10 12:07:59,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1189 states and 1644 transitions. [2018-11-10 12:07:59,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:59,094 INFO L705 BuchiCegarLoop]: Abstraction has 1189 states and 1644 transitions. [2018-11-10 12:07:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states and 1644 transitions. [2018-11-10 12:07:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1042. [2018-11-10 12:07:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-11-10 12:07:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1431 transitions. [2018-11-10 12:07:59,135 INFO L728 BuchiCegarLoop]: Abstraction has 1042 states and 1431 transitions. [2018-11-10 12:07:59,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 12:07:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:07:59,135 INFO L87 Difference]: Start difference. First operand 1042 states and 1431 transitions. Second operand 17 states. [2018-11-10 12:07:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:07:59,437 INFO L93 Difference]: Finished difference Result 417 states and 563 transitions. [2018-11-10 12:07:59,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 12:07:59,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 563 transitions. [2018-11-10 12:07:59,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 12:07:59,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 368 states and 505 transitions. [2018-11-10 12:07:59,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2018-11-10 12:07:59,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2018-11-10 12:07:59,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 505 transitions. [2018-11-10 12:07:59,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:07:59,447 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 505 transitions. [2018-11-10 12:07:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 505 transitions. [2018-11-10 12:07:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 333. [2018-11-10 12:07:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-10 12:07:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 445 transitions. [2018-11-10 12:07:59,459 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 445 transitions. [2018-11-10 12:07:59,459 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 445 transitions. [2018-11-10 12:07:59,459 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:07:59,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 445 transitions. [2018-11-10 12:07:59,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 12:07:59,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:07:59,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:07:59,463 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, 1] [2018-11-10 12:07:59,463 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-10 12:07:59,464 INFO L793 eck$LassoCheckResult]: Stem: 8140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8102#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8103#fibo1ENTRY ~n := #in~n; 8212#L8 assume !(~n < 1); 8207#L10 assume !(~n == 1); 8075#L13 call #t~ret0 := fibo2(~n - 1);< 8202#fibo2ENTRY ~n := #in~n; 8186#L18 assume !(~n < 1); 8187#L20 assume !(~n == 1); 8074#L23 call #t~ret2 := fibo1(~n - 1);< 8076#fibo1ENTRY ~n := #in~n; 8211#L8 assume !(~n < 1); 8206#L10 assume !(~n == 1); 8183#L13 call #t~ret0 := fibo2(~n - 1);< 8192#fibo2ENTRY ~n := #in~n; 8193#L18 assume !(~n < 1); 8182#L20 assume !(~n == 1); 8185#L23 call #t~ret2 := fibo1(~n - 1);< 8214#fibo1ENTRY ~n := #in~n; 8210#L8 assume !(~n < 1); 8205#L10 assume !(~n == 1); 8184#L13 call #t~ret0 := fibo2(~n - 1);< 8192#fibo2ENTRY ~n := #in~n; 8193#L18 assume !(~n < 1); 8182#L20 assume !(~n == 1); 8185#L23 call #t~ret2 := fibo1(~n - 1);< 8214#fibo1ENTRY ~n := #in~n; 8215#L8 assume !(~n < 1); 8300#L10 assume ~n == 1;#res := 1; 8294#fibo1FINAL assume true; 8264#fibo1EXIT >#46#return; 8256#L23-1 call #t~ret3 := fibo1(~n - 2);< 8258#fibo1ENTRY ~n := #in~n; 8266#L8 assume ~n < 1;#res := 0; 8263#fibo1FINAL assume true; 8255#fibo1EXIT >#48#return; 8253#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8219#fibo2FINAL assume true; 8220#fibo2EXIT >#50#return; 8177#L13-1 [2018-11-10 12:07:59,464 INFO L795 eck$LassoCheckResult]: Loop: 8177#L13-1 call #t~ret1 := fibo2(~n - 2);< 8131#fibo2ENTRY ~n := #in~n; 8179#L18 assume !(~n < 1); 8178#L20 assume !(~n == 1); 8130#L23 call #t~ret2 := fibo1(~n - 1);< 8174#fibo1ENTRY ~n := #in~n; 8173#L8 assume !(~n < 1); 8169#L10 assume !(~n == 1); 8171#L13 call #t~ret0 := fibo2(~n - 1);< 8247#fibo2ENTRY ~n := #in~n; 8262#L18 assume !(~n < 1); 8261#L20 assume !(~n == 1); 8121#L23 call #t~ret2 := fibo1(~n - 1);< 8073#fibo1ENTRY ~n := #in~n; 8376#L8 assume !(~n < 1); 8374#L10 assume ~n == 1;#res := 1; 8375#fibo1FINAL assume true; 8379#fibo1EXIT >#46#return; 8315#L23-1 call #t~ret3 := fibo1(~n - 2);< 8080#fibo1ENTRY ~n := #in~n; 8392#L8 assume ~n < 1;#res := 0; 8377#fibo1FINAL assume true; 8314#fibo1EXIT >#48#return; 8303#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8295#fibo2FINAL assume true; 8246#fibo2EXIT >#50#return; 8238#L13-1 call #t~ret1 := fibo2(~n - 2);< 8239#fibo2ENTRY ~n := #in~n; 8299#L18 assume ~n < 1;#res := 0; 8249#fibo2FINAL assume true; 8251#fibo2EXIT >#52#return; 8233#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8230#fibo1FINAL assume true; 8221#fibo1EXIT >#46#return; 8199#L23-1 call #t~ret3 := fibo1(~n - 2);< 8213#fibo1ENTRY ~n := #in~n; 8208#L8 assume !(~n < 1); 8203#L10 assume !(~n == 1); 8195#L13 call #t~ret0 := fibo2(~n - 1);< 8201#fibo2ENTRY ~n := #in~n; 8218#L18 assume !(~n < 1); 8216#L20 assume !(~n == 1); 8200#L23 call #t~ret2 := fibo1(~n - 1);< 8213#fibo1ENTRY ~n := #in~n; 8208#L8 assume !(~n < 1); 8203#L10 assume !(~n == 1); 8195#L13 call #t~ret0 := fibo2(~n - 1);< 8201#fibo2ENTRY ~n := #in~n; 8218#L18 assume !(~n < 1); 8216#L20 assume ~n == 1;#res := 1; 8217#fibo2FINAL assume true; 8272#fibo2EXIT >#50#return; 8270#L13-1 call #t~ret1 := fibo2(~n - 2);< 8271#fibo2ENTRY ~n := #in~n; 8284#L18 assume ~n < 1;#res := 0; 8283#fibo2FINAL assume true; 8269#fibo2EXIT >#52#return; 8268#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8265#fibo1FINAL assume true; 8260#fibo1EXIT >#46#return; 8243#L23-1 call #t~ret3 := fibo1(~n - 2);< 8248#fibo1ENTRY ~n := #in~n; 8290#L8 assume !(~n < 1); 8286#L10 assume !(~n == 1); 8273#L13 call #t~ret0 := fibo2(~n - 1);< 8276#fibo2ENTRY ~n := #in~n; 8292#L18 assume !(~n < 1); 8288#L20 assume ~n == 1;#res := 1; 8217#fibo2FINAL assume true; 8272#fibo2EXIT >#50#return; 8270#L13-1 call #t~ret1 := fibo2(~n - 2);< 8271#fibo2ENTRY ~n := #in~n; 8284#L18 assume ~n < 1;#res := 0; 8283#fibo2FINAL assume true; 8269#fibo2EXIT >#52#return; 8268#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8265#fibo1FINAL assume true; 8260#fibo1EXIT >#48#return; 8244#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8240#fibo2FINAL assume true; 8194#fibo2EXIT >#50#return; 8177#L13-1 [2018-11-10 12:07:59,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1448014817, now seen corresponding path program 1 times [2018-11-10 12:07:59,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:59,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:59,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:59,620 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-10 12:07:59,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:59,621 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:59,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:59,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:59,648 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-10 12:07:59,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:07:59,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-10 12:07:59,675 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:07:59,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:07:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1739702963, now seen corresponding path program 1 times [2018-11-10 12:07:59,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:07:59,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:07:59,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:59,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:59,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:07:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:59,758 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-10 12:07:59,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:07:59,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:07:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:07:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:59,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:07:59,831 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-10 12:07:59,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:07:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-10 12:07:59,859 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:07:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 12:07:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:07:59,860 INFO L87 Difference]: Start difference. First operand 333 states and 445 transitions. cyclomatic complexity: 116 Second operand 17 states. [2018-11-10 12:08:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:08:00,146 INFO L93 Difference]: Finished difference Result 419 states and 601 transitions. [2018-11-10 12:08:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:08:00,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 601 transitions. [2018-11-10 12:08:00,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 12:08:00,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 416 states and 597 transitions. [2018-11-10 12:08:00,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2018-11-10 12:08:00,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2018-11-10 12:08:00,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 597 transitions. [2018-11-10 12:08:00,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:08:00,156 INFO L705 BuchiCegarLoop]: Abstraction has 416 states and 597 transitions. [2018-11-10 12:08:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 597 transitions. [2018-11-10 12:08:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 394. [2018-11-10 12:08:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-10 12:08:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2018-11-10 12:08:00,169 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 559 transitions. [2018-11-10 12:08:00,169 INFO L608 BuchiCegarLoop]: Abstraction has 394 states and 559 transitions. [2018-11-10 12:08:00,169 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:08:00,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 559 transitions. [2018-11-10 12:08:00,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 12:08:00,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:08:00,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:08:00,173 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, 1] [2018-11-10 12:08:00,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1] [2018-11-10 12:08:00,173 INFO L793 eck$LassoCheckResult]: Stem: 9277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9238#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9239#fibo1ENTRY ~n := #in~n; 9403#L8 assume !(~n < 1); 9416#L10 assume !(~n == 1); 9417#L13 call #t~ret0 := fibo2(~n - 1);< 9424#fibo2ENTRY ~n := #in~n; 9423#L18 assume !(~n < 1); 9422#L20 assume !(~n == 1); 9259#L23 call #t~ret2 := fibo1(~n - 1);< 9421#fibo1ENTRY ~n := #in~n; 9418#L8 assume !(~n < 1); 9419#L10 assume !(~n == 1); 9231#L13 call #t~ret0 := fibo2(~n - 1);< 9260#fibo2ENTRY ~n := #in~n; 9460#L18 assume !(~n < 1); 9459#L20 assume !(~n == 1); 9230#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9276#L8 assume !(~n < 1); 9236#L10 assume !(~n == 1); 9237#L13 call #t~ret0 := fibo2(~n - 1);< 9279#fibo2ENTRY ~n := #in~n; 9281#L18 assume !(~n < 1); 9288#L20 assume !(~n == 1); 9289#L23 call #t~ret2 := fibo1(~n - 1);< 9454#fibo1ENTRY ~n := #in~n; 9514#L8 assume !(~n < 1); 9513#L10 assume !(~n == 1); 9280#L13 call #t~ret0 := fibo2(~n - 1);< 9279#fibo2ENTRY ~n := #in~n; 9281#L18 assume !(~n < 1); 9288#L20 assume !(~n == 1); 9289#L23 call #t~ret2 := fibo1(~n - 1);< 9454#fibo1ENTRY ~n := #in~n; 9515#L8 assume !(~n < 1); 9567#L10 assume ~n == 1;#res := 1; 9566#fibo1FINAL assume true; 9500#fibo1EXIT >#46#return; 9457#L23-1 call #t~ret3 := fibo1(~n - 2);< 9464#fibo1ENTRY ~n := #in~n; 9553#L8 assume ~n < 1;#res := 0; 9550#fibo1FINAL assume true; 9497#fibo1EXIT >#48#return; 9494#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9491#fibo2FINAL assume true; 9409#fibo2EXIT >#50#return; 9345#L13-1 [2018-11-10 12:08:00,173 INFO L795 eck$LassoCheckResult]: Loop: 9345#L13-1 call #t~ret1 := fibo2(~n - 2);< 9265#fibo2ENTRY ~n := #in~n; 9461#L18 assume !(~n < 1); 9343#L20 assume !(~n == 1); 9264#L23 call #t~ret2 := fibo1(~n - 1);< 9455#fibo1ENTRY ~n := #in~n; 9509#L8 assume !(~n < 1); 9330#L10 assume !(~n == 1); 9332#L13 call #t~ret0 := fibo2(~n - 1);< 9506#fibo2ENTRY ~n := #in~n; 9538#L18 assume !(~n < 1); 9536#L20 assume !(~n == 1); 9526#L23 call #t~ret2 := fibo1(~n - 1);< 9547#fibo1ENTRY ~n := #in~n; 9564#L8 assume !(~n < 1); 9563#L10 assume ~n == 1;#res := 1; 9549#fibo1FINAL assume true; 9546#fibo1EXIT >#46#return; 9274#L23-1 call #t~ret3 := fibo1(~n - 2);< 9248#fibo1ENTRY ~n := #in~n; 9275#L8 assume ~n < 1;#res := 0; 9565#fibo1FINAL assume true; 9544#fibo1EXIT >#48#return; 9542#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9540#fibo2FINAL assume true; 9539#fibo2EXIT >#50#return; 9479#L13-1 call #t~ret1 := fibo2(~n - 2);< 9482#fibo2ENTRY ~n := #in~n; 9590#L18 assume ~n < 1;#res := 0; 9537#fibo2FINAL assume true; 9531#fibo2EXIT >#52#return; 9481#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9571#fibo1FINAL assume true; 9452#fibo1EXIT >#46#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(~n == 1); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume !(~n == 1); 9412#L23 call #t~ret2 := fibo1(~n - 1);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(~n == 1); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume !(~n == 1); 9412#L23 call #t~ret2 := fibo1(~n - 1);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume ~n == 1;#res := 1; 9493#fibo1FINAL assume true; 9507#fibo1EXIT >#46#return; 9446#L23-1 call #t~ret3 := fibo1(~n - 2);< 9499#fibo1ENTRY ~n := #in~n; 9495#L8 assume !(~n < 1); 9492#L10 assume !(~n == 1); 9486#L13 call #t~ret0 := fibo2(~n - 1);< 9489#fibo2ENTRY ~n := #in~n; 9517#L18 assume !(~n < 1); 9516#L20 assume ~n == 1;#res := 1; 9428#fibo2FINAL assume true; 9485#fibo2EXIT >#50#return; 9469#L13-1 call #t~ret1 := fibo2(~n - 2);< 9472#fibo2ENTRY ~n := #in~n; 9477#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9465#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9462#fibo1FINAL assume true; 9456#fibo1EXIT >#48#return; 9448#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9430#fibo2FINAL assume true; 9404#fibo2EXIT >#50#return; 9345#L13-1 call #t~ret1 := fibo2(~n - 2);< 9431#fibo2ENTRY ~n := #in~n; 9574#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9471#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9569#fibo1FINAL assume true; 9451#fibo1EXIT >#46#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(~n == 1); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume ~n == 1;#res := 1; 9428#fibo2FINAL assume true; 9485#fibo2EXIT >#50#return; 9469#L13-1 call #t~ret1 := fibo2(~n - 2);< 9472#fibo2ENTRY ~n := #in~n; 9477#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9465#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9462#fibo1FINAL assume true; 9456#fibo1EXIT >#48#return; 9443#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9441#fibo2FINAL assume true; 9440#fibo2EXIT >#50#return; 9345#L13-1 [2018-11-10 12:08:00,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1654199334, now seen corresponding path program 2 times [2018-11-10 12:08:00,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:08:00,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:08:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:08:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:00,316 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-10 12:08:00,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:08:00,316 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:08:00,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:08:00,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:08:00,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:08:00,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:00,369 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-10 12:08:00,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:08:00,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-11-10 12:08:00,386 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:08:00,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 197922261, now seen corresponding path program 2 times [2018-11-10 12:08:00,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:08:00,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:08:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:00,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:08:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 80 proven. 25 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-10 12:08:00,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:08:00,450 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:08:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:08:00,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:08:00,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:08:00,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 162 proven. 3 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-10 12:08:00,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:08:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-10 12:08:00,562 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:08:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 12:08:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:08:00,563 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. cyclomatic complexity: 169 Second operand 23 states. [2018-11-10 12:08:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:08:00,980 INFO L93 Difference]: Finished difference Result 504 states and 669 transitions. [2018-11-10 12:08:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 12:08:00,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 669 transitions. [2018-11-10 12:08:00,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:08:00,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 454 states and 592 transitions. [2018-11-10 12:08:00,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2018-11-10 12:08:00,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2018-11-10 12:08:00,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 592 transitions. [2018-11-10 12:08:00,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:08:00,993 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 592 transitions. [2018-11-10 12:08:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 592 transitions. [2018-11-10 12:08:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 428. [2018-11-10 12:08:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-10 12:08:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 551 transitions. [2018-11-10 12:08:01,005 INFO L728 BuchiCegarLoop]: Abstraction has 428 states and 551 transitions. [2018-11-10 12:08:01,005 INFO L608 BuchiCegarLoop]: Abstraction has 428 states and 551 transitions. [2018-11-10 12:08:01,005 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:08:01,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 551 transitions. [2018-11-10 12:08:01,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:08:01,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:08:01,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:08:01,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:08:01,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:08:01,010 INFO L793 eck$LassoCheckResult]: Stem: 10719#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10714#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10690#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10691#fibo1ENTRY ~n := #in~n; 10793#L8 assume !(~n < 1); 10792#L10 assume !(~n == 1); 10790#L13 call #t~ret0 := fibo2(~n - 1);< 10791#fibo2ENTRY ~n := #in~n; 10811#L18 assume !(~n < 1); 10810#L20 assume !(~n == 1); 10807#L23 call #t~ret2 := fibo1(~n - 1);< 10808#fibo1ENTRY ~n := #in~n; 10871#L8 assume !(~n < 1); 10867#L10 assume !(~n == 1); 10721#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10722#L18 assume !(~n < 1); 10731#L20 assume !(~n == 1); 10858#L23 call #t~ret2 := fibo1(~n - 1);< 10859#fibo1ENTRY ~n := #in~n; 11079#L8 assume !(~n < 1); 11078#L10 assume !(~n == 1); 10676#L13 call #t~ret0 := fibo2(~n - 1);< 10923#fibo2ENTRY ~n := #in~n; 10962#L18 assume !(~n < 1); 10945#L20 assume !(~n == 1); 10942#L23 call #t~ret2 := fibo1(~n - 1);< 10943#fibo1ENTRY ~n := #in~n; 10967#L8 assume !(~n < 1); 10963#L10 assume !(~n == 1); 10954#L13 call #t~ret0 := fibo2(~n - 1);< 10955#fibo2ENTRY ~n := #in~n; 10979#L18 assume !(~n < 1); 10977#L20 assume ~n == 1;#res := 1; 10976#fibo2FINAL assume true; 10953#fibo2EXIT >#50#return; 10950#L13-1 call #t~ret1 := fibo2(~n - 2);< 10951#fibo2ENTRY ~n := #in~n; 10980#L18 assume ~n < 1;#res := 0; 10978#fibo2FINAL assume true; 10949#fibo2EXIT >#52#return; 10947#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10946#fibo1FINAL assume true; 10941#fibo1EXIT >#46#return; 10684#L23-1 call #t~ret3 := fibo1(~n - 2);< 10940#fibo1ENTRY ~n := #in~n; 10991#L8 assume ~n < 1;#res := 0; 10990#fibo1FINAL assume true; 10988#fibo1EXIT >#48#return; 10986#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10985#fibo2FINAL assume true; 10922#fibo2EXIT >#50#return; 10674#L13-1 call #t~ret1 := fibo2(~n - 2);< 10870#fibo2ENTRY ~n := #in~n; 10936#L18 assume !(~n < 1); 10934#L20 assume !(~n == 1); 10930#L23 call #t~ret2 := fibo1(~n - 1);< 10932#fibo1ENTRY ~n := #in~n; 10974#L8 assume !(~n < 1); 10970#L10 assume !(~n == 1); 10667#L13 call #t~ret0 := fibo2(~n - 1);< 10966#fibo2ENTRY ~n := #in~n; 10975#L18 assume !(~n < 1); 10972#L20 assume !(~n == 1); 10973#L23 call #t~ret2 := fibo1(~n - 1);< 11027#fibo1ENTRY [2018-11-10 12:08:01,010 INFO L795 eck$LassoCheckResult]: Loop: 11027#fibo1ENTRY ~n := #in~n; 11049#L8 assume !(~n < 1); 11048#L10 assume !(~n == 1); 11010#L13 call #t~ret0 := fibo2(~n - 1);< 11017#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(~n == 1); 11035#L23 call #t~ret2 := fibo1(~n - 1);< 11027#fibo1ENTRY [2018-11-10 12:08:01,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 746131068, now seen corresponding path program 1 times [2018-11-10 12:08:01,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:08:01,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:08:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:01,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:08:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 12:08:01,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:08:01,090 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:08:01,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:08:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 60 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:08:01,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:08:01,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 22 [2018-11-10 12:08:01,302 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:08:01,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 2 times [2018-11-10 12:08:01,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:08:01,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:08:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:08:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:08:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:08:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:08:01,382 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:08:01,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:08:01,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:08:01,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:08:01,383 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:08:01,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:08:01,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:08:01,383 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:08:01,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 12:08:01,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:08:01,383 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:08:01,384 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-10 12:08:01,401 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-10 12:08:01,412 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-10 12:08:01,414 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-10 12:08:01,416 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-10 12:08:01,418 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-10 12:08:01,422 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-10 12:08:01,424 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-10 12:08:01,438 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-10 12:08:01,442 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-10 12:08:01,493 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:08:01,493 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:08:01,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:08:01,502 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d63bc1dd-e56b-496f-80ed-33b41bcf6681/bin-2019/uautomizer/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-10 12:08:01,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:08:01,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:08:01,577 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:08:01,578 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:08:01,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:08:01,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:08:01,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:08:01,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:08:01,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:08:01,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:08:01,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:08:01,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 12:08:01,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:08:01,579 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:08:01,579 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-10 12:08:01,583 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-10 12:08:01,584 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-10 12:08:01,585 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-10 12:08:01,586 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-10 12:08:01,587 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-10 12:08:01,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-10 12:08:01,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-10 12:08:01,589 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-10 12:08:01,590 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-10 12:08:01,609 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:08:01,609 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:08:01,609 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-10 12:08:01,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:08:01,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:08:01,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:08:01,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:08:01,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:08:01,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:08:01,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:08:01,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:08:01,615 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:08:01,615 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:08:01,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:08:01,615 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:08:01,615 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:08:01,615 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 12:08:01,616 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:08:01,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:01,721 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-10 12:08:01,721 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-10 12:08:01,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-10 12:08:01,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 455 states and 578 transitions. Complement of second has 22 states. [2018-11-10 12:08:01,803 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-10 12:08:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:08:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-11-10 12:08:01,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 12:08:01,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:08:01,804 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:08:01,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:01,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:01,904 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-10 12:08:01,904 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-10 12:08:01,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-10 12:08:01,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 455 states and 578 transitions. Complement of second has 22 states. [2018-11-10 12:08:01,989 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-10 12:08:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:08:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-11-10 12:08:01,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 12:08:01,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:08:01,990 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:08:02,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:02,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:08:02,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:08:02,104 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-10 12:08:02,104 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-10 12:08:02,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-10 12:08:02,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 755 states and 917 transitions. Complement of second has 25 states. [2018-11-10 12:08:02,191 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-10 12:08:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:08:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-10 12:08:02,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 12:08:02,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:08:02,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 73 letters. Loop has 8 letters. [2018-11-10 12:08:02,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:08:02,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 65 letters. Loop has 16 letters. [2018-11-10 12:08:02,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:08:02,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 917 transitions. [2018-11-10 12:08:02,205 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:08:02,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 0 states and 0 transitions. [2018-11-10 12:08:02,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:08:02,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:08:02,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:08:02,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:08:02,205 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:08:02,205 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:08:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 12:08:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:08:02,206 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 22 states. [2018-11-10 12:08:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:08:02,206 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:08:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:08:02,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:08:02,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:08:02,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:08:02,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:08:02,207 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:08:02,207 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:08:02,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:08:02,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:08:02,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:08:02,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:08:02 BoogieIcfgContainer [2018-11-10 12:08:02,215 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:08:02,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:08:02,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:08:02,215 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:08:02,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:07:52" (3/4) ... [2018-11-10 12:08:02,219 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:08:02,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:08:02,220 INFO L168 Benchmark]: Toolchain (without parser) took 9674.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -287.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,222 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:08:02,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.45 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.47 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:08:02,223 INFO L168 Benchmark]: Boogie Preprocessor took 10.76 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,223 INFO L168 Benchmark]: RCFGBuilder took 194.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -245.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,224 INFO L168 Benchmark]: BuchiAutomizer took 9291.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -63.3 MB). Peak memory consumption was 121.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,224 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:02,227 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.45 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.47 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.76 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -245.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9291.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -63.3 MB). Peak memory consumption was 121.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. 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 9.2s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 5.2s. Construction of modules took 1.2s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 428 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 328 SDtfs, 759 SDslu, 926 SDs, 0 SdLazy, 2077 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...