./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 f612eebc128d68e9b4bc81ed92184f640c3b9bd4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:31:15,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:31:15,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:31:15,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:31:15,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:31:15,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:31:15,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:31:15,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:31:15,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:31:15,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:31:15,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:31:15,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:31:15,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:31:15,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:31:15,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:31:15,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:31:15,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:31:15,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:31:15,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:31:15,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:31:15,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:31:15,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:31:15,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:31:15,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:31:15,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:31:15,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:31:15,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:31:15,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:31:15,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:31:15,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:31:15,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:31:15,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:31:15,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:31:15,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:31:15,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:31:15,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:31:15,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:31:15,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:31:15,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:31:15,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:31:15,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:31:15,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:31:15,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:31:15,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:31:15,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:31:15,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:31:15,760 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:31:15,761 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:31:15,761 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:31:15,761 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:31:15,761 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:31:15,762 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:31:15,762 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:31:15,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:31:15,762 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:31:15,762 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:31:15,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:31:15,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:31:15,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:31:15,764 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:31:15,764 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:31:15,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:31:15,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:31:15,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:31:15,765 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:31:15,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:31:15,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:31:15,766 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:31:15,767 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:31:15,767 INFO L138 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/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 -> f612eebc128d68e9b4bc81ed92184f640c3b9bd4 [2019-11-15 20:31:15,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:31:15,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:31:15,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:31:15,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:31:15,816 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:31:15,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7-1.c [2019-11-15 20:31:15,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/data/bd704378d/ebf268a73d6b4a998f5d8661029a99a6/FLAG5ab8cbf29 [2019-11-15 20:31:16,286 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:31:16,289 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/sv-benchmarks/c/recursive-simple/fibo_7-1.c [2019-11-15 20:31:16,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/data/bd704378d/ebf268a73d6b4a998f5d8661029a99a6/FLAG5ab8cbf29 [2019-11-15 20:31:16,311 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/data/bd704378d/ebf268a73d6b4a998f5d8661029a99a6 [2019-11-15 20:31:16,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:31:16,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:31:16,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:31:16,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:31:16,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:31:16,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd7c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16, skipping insertion in model container [2019-11-15 20:31:16,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:31:16,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:31:16,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:31:16,527 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:31:16,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:31:16,620 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:31:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16 WrapperNode [2019-11-15 20:31:16,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:31:16,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:31:16,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:31:16,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:31:16,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:31:16,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:31:16,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:31:16,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:31:16,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... [2019-11-15 20:31:16,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:31:16,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:31:16,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:31:16,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:31:16,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:31:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:31:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-15 20:31:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-15 20:31:16,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:31:16,904 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:31:16,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:31:16 BoogieIcfgContainer [2019-11-15 20:31:16,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:31:16,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:31:16,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:31:16,921 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:31:16,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:31:16,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:31:16" (1/3) ... [2019-11-15 20:31:16,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b3c3358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:31:16, skipping insertion in model container [2019-11-15 20:31:16,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:31:16,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:16" (2/3) ... [2019-11-15 20:31:16,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b3c3358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:31:16, skipping insertion in model container [2019-11-15 20:31:16,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:31:16,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:31:16" (3/3) ... [2019-11-15 20:31:16,925 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_7-1.c [2019-11-15 20:31:17,034 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:31:17,034 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:31:17,034 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:31:17,034 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:31:17,035 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:31:17,035 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:31:17,035 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:31:17,035 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:31:17,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:31:17,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:17,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:17,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:17,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:31:17,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:31:17,076 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:31:17,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:31:17,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:17,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:17,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:17,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:31:17,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:31:17,086 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-11-15 20:31:17,087 INFO L793 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-11-15 20:31:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-11-15 20:31:17,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:17,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218902006] [2019-11-15 20:31:17,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,182 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-11-15 20:31:17,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:17,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896052297] [2019-11-15 20:31:17,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-11-15 20:31:17,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:17,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858379512] [2019-11-15 20:31:17,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:17,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:17,330 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:17,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:17,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:17,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:17,331 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:17,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:17,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:17,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration1_Loop [2019-11-15 20:31:17,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:17,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:17,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:17,449 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:17,466 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:17,475 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:17,490 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:17,495 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:17,510 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,514 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:17,514 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:17,531 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,536 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:17,536 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:17,553 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:17,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:17,566 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,576 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:17,578 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:17,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:17,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:17,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:17,579 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:17,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:17,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:17,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:17,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration1_Loop [2019-11-15 20:31:17,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:17,580 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:17,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:17,740 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:17,744 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:17,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:17,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:17,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:17,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:17,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:17,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:17,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:17,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:17,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:17,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:17,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:17,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:17,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:17,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:17,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:17,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:17,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:17,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:17,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:17,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:17,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:17,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:17,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:17,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:17,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:17,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:17,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:17,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:17,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:17,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:17,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:17,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:17,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:17,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:17,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:17,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:17,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:17,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:17,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:17,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:17,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:17,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:17,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:17,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:17,774 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:17,780 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:17,780 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:17,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:17,782 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:17,782 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:17,783 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 20:31:17,785 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:17,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:31:17,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:17,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:17,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:17,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:31:17,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-11-15 20:31:18,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-11-15 20:31:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:31:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 20:31:18,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 20:31:18,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:18,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 20:31:18,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:18,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 20:31:18,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:18,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-11-15 20:31:18,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:18,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-11-15 20:31:18,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:31:18,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:31:18,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 20:31:18,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:18,060 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:31:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 20:31:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 20:31:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:31:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 20:31:18,087 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:31:18,088 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:31:18,088 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:31:18,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 20:31:18,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:18,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:18,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:18,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:18,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:18,090 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 20:31:18,090 INFO L793 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 20:31:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-11-15 20:31:18,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:18,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330924739] [2019-11-15 20:31:18,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:18,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330924739] [2019-11-15 20:31:18,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823780231] [2019-11-15 20:31:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:31:18,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:18,242 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:18,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:31:18,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748657327] [2019-11-15 20:31:18,244 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-11-15 20:31:18,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:18,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361879971] [2019-11-15 20:31:18,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:31:18,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361879971] [2019-11-15 20:31:18,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:31:18,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:31:18,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583709878] [2019-11-15 20:31:18,317 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:31:18,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:31:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:31:18,321 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 20:31:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:18,403 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-15 20:31:18,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:31:18,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 20:31:18,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:18,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-15 20:31:18,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 20:31:18,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 20:31:18,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 20:31:18,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:18,407 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:31:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 20:31:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 20:31:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:31:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 20:31:18,411 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:31:18,411 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:31:18,411 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:31:18,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 20:31:18,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:31:18,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:18,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:18,413 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:18,413 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:18,414 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 221#L25 call main_#t~ret2 := fibo(main_~x~0);< 225#fiboENTRY ~n := #in~n; 226#L6 assume !(~n < 1); 224#L8 assume !(1 == ~n); 218#L11 call #t~ret0 := fibo(~n - 1);< 227#fiboENTRY ~n := #in~n; 228#L6 assume !(~n < 1); 222#L8 assume 1 == ~n;#res := 1; 223#fiboFINAL assume true; 217#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 20:31:18,414 INFO L793 eck$LassoCheckResult]: Loop: 219#L11-1 call #t~ret1 := fibo(~n - 2);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume !(1 == ~n); 230#L11 call #t~ret0 := fibo(~n - 1);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume 1 == ~n;#res := 1; 236#fiboFINAL assume true; 234#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 20:31:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-11-15 20:31:18,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:18,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585940944] [2019-11-15 20:31:18,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:18,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585940944] [2019-11-15 20:31:18,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928137640] [2019-11-15 20:31:18,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:18,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:31:18,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:18,533 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:18,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:31:18,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110279092] [2019-11-15 20:31:18,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-11-15 20:31:18,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:18,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290489127] [2019-11-15 20:31:18,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:18,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:18,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:18,663 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:18,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:18,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:18,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:18,663 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:18,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:18,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:18,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:18,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration3_Loop [2019-11-15 20:31:18,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:18,664 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:18,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:18,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:18,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:18,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:18,723 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:18,723 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:18,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:18,734 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:18,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:18,749 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:19,269 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:19,271 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:19,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:19,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:19,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:19,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:19,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:19,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:19,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:19,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration3_Loop [2019-11-15 20:31:19,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:19,272 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:19,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:19,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:19,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:19,348 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:19,348 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:19,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:19,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:19,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:19,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:19,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:19,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:19,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:19,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:19,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:19,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:19,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:19,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:19,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:19,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:19,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:19,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:19,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:19,363 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:19,368 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:19,368 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:19,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:19,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:19,369 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:19,369 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:31:19,370 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:19,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:31:19,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:31:19,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:19,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-15 20:31:19,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 20:31:19,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-11-15 20:31:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:31:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-15 20:31:19,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 20:31:19,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:19,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-15 20:31:19,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:19,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-11-15 20:31:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:19,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-15 20:31:19,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:31:19,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-15 20:31:19,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 20:31:19,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:31:19,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-15 20:31:19,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:19,755 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-15 20:31:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-15 20:31:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-15 20:31:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:31:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-15 20:31:19,791 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-15 20:31:19,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:31:19,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:31:19,792 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-15 20:31:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:19,876 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-15 20:31:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:31:19,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-15 20:31:19,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:31:19,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-15 20:31:19,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 20:31:19,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:31:19,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-15 20:31:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:19,887 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-15 20:31:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-15 20:31:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 20:31:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:31:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 20:31:19,899 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:31:19,899 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:31:19,899 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:31:19,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-15 20:31:19,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:31:19,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:19,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:19,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:19,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-15 20:31:19,904 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 745#L25 call main_#t~ret2 := fibo(main_~x~0);< 769#fiboENTRY ~n := #in~n; 793#L6 assume !(~n < 1); 752#L8 assume !(1 == ~n); 753#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 762#L6 assume !(~n < 1); 796#L8 assume 1 == ~n;#res := 1; 795#fiboFINAL assume true; 794#fiboEXIT >#32#return; 757#L11-1 call #t~ret1 := fibo(~n - 2);< 756#fiboENTRY ~n := #in~n; 758#L6 assume ~n < 1;#res := 0; 823#fiboFINAL assume true; 817#fiboEXIT >#34#return; 814#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 812#fiboFINAL assume true; 802#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 20:31:19,904 INFO L793 eck$LassoCheckResult]: Loop: 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume ~n < 1;#res := 0; 819#fiboFINAL assume true; 821#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 20:31:19,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-11-15 20:31:19,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:19,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314737937] [2019-11-15 20:31:19,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:19,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:19,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:31:20,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314737937] [2019-11-15 20:31:20,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664675321] [2019-11-15 20:31:20,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:31:20,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:31:20,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:20,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-15 20:31:20,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956771630] [2019-11-15 20:31:20,093 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-11-15 20:31:20,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:20,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343221342] [2019-11-15 20:31:20,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 20:31:20,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343221342] [2019-11-15 20:31:20,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188233056] [2019-11-15 20:31:20,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:31:20,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 20:31:20,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:20,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 20:31:20,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543021163] [2019-11-15 20:31:20,284 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:31:20,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:31:20,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:31:20,285 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-15 20:31:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:20,482 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-15 20:31:20,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:31:20,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-15 20:31:20,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 20:31:20,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-15 20:31:20,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-15 20:31:20,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 20:31:20,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-15 20:31:20,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:20,490 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 20:31:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-15 20:31:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 20:31:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 20:31:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-15 20:31:20,501 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 20:31:20,501 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 20:31:20,501 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:31:20,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-15 20:31:20,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 20:31:20,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:20,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:20,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:20,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 20:31:20,506 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 1249#L25 call main_#t~ret2 := fibo(main_~x~0);< 1278#fiboENTRY ~n := #in~n; 1308#L6 assume !(~n < 1); 1307#L8 assume !(1 == ~n); 1256#L11 call #t~ret0 := fibo(~n - 1);< 1273#fiboENTRY ~n := #in~n; 1274#L6 assume !(~n < 1); 1255#L8 assume !(1 == ~n); 1257#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1306#L6 assume !(~n < 1); 1304#L8 assume 1 == ~n;#res := 1; 1302#fiboFINAL assume true; 1300#fiboEXIT >#32#return; 1243#L11-1 call #t~ret1 := fibo(~n - 2);< 1298#fiboENTRY ~n := #in~n; 1345#L6 assume ~n < 1;#res := 0; 1344#fiboFINAL assume true; 1342#fiboEXIT >#34#return; 1340#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1339#fiboFINAL assume true; 1332#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 20:31:20,506 INFO L793 eck$LassoCheckResult]: Loop: 1260#L11-1 call #t~ret1 := fibo(~n - 2);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume 1 == ~n;#res := 1; 1254#fiboFINAL assume true; 1346#fiboEXIT >#32#return; 1252#L11-1 call #t~ret1 := fibo(~n - 2);< 1271#fiboENTRY ~n := #in~n; 1272#L6 assume ~n < 1;#res := 0; 1310#fiboFINAL assume true; 1347#fiboEXIT >#34#return; 1244#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1258#fiboFINAL assume true; 1264#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 20:31:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-11-15 20:31:20,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:20,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292744671] [2019-11-15 20:31:20,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:31:20,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292744671] [2019-11-15 20:31:20,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290580301] [2019-11-15 20:31:20,631 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:20,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:31:20,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:31:20,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:31:20,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 20:31:20,750 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:20,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-15 20:31:20,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645770787] [2019-11-15 20:31:20,750 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-11-15 20:31:20,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:20,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462615231] [2019-11-15 20:31:20,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:20,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:20,767 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:21,015 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:21,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:21,016 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:21,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:21,016 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:21,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:21,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:21,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:21,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration5_Loop [2019-11-15 20:31:21,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:21,016 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:21,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,089 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:21,090 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:21,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:21,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:21,097 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:21,097 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:21,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:21,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:21,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:21,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:21,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:21,122 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:21,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:21,126 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=1} Honda state: {fibo_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:21,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:21,151 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:21,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:21,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:21,702 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:21,704 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:21,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:21,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:21,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:21,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:21,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:21,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:21,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:21,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration5_Loop [2019-11-15 20:31:21,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:21,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:21,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:21,803 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:21,803 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:21,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:21,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:21,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:21,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:21,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:21,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:21,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:21,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:21,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:21,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:21,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:21,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:21,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:21,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:21,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:21,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:21,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:21,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:21,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:21,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:21,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:21,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:21,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:21,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:21,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:21,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:21,815 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:21,818 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:21,818 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:21,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:21,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:21,819 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:21,819 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:31:21,820 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:21,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:31:21,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:21,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:21,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:31:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:31:22,032 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 20:31:22,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 20:31:22,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 182 states and 247 transitions. Complement of second has 33 states. [2019-11-15 20:31:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:31:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 20:31:22,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:31:22,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:22,256 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:31:22,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:22,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:22,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:22,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:31:22,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:31:22,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 20:31:22,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 20:31:22,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 307 states and 416 transitions. Complement of second has 25 states. [2019-11-15 20:31:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:31:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 20:31:22,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:31:22,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:22,614 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:22,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:31:22,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:22,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:22,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:22,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:31:22,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:31:22,814 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 20:31:22,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 20:31:23,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 1077 states and 1512 transitions. Complement of second has 130 states. [2019-11-15 20:31:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:31:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 20:31:23,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:31:23,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:23,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-11-15 20:31:23,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:23,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-11-15 20:31:23,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:23,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1512 transitions. [2019-11-15 20:31:23,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-15 20:31:23,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 935 transitions. [2019-11-15 20:31:23,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-15 20:31:23,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-11-15 20:31:23,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 935 transitions. [2019-11-15 20:31:23,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:23,173 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 935 transitions. [2019-11-15 20:31:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 935 transitions. [2019-11-15 20:31:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 477. [2019-11-15 20:31:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-15 20:31:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 725 transitions. [2019-11-15 20:31:23,247 INFO L711 BuchiCegarLoop]: Abstraction has 477 states and 725 transitions. [2019-11-15 20:31:23,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:23,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:31:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:31:23,249 INFO L87 Difference]: Start difference. First operand 477 states and 725 transitions. Second operand 14 states. [2019-11-15 20:31:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:23,529 INFO L93 Difference]: Finished difference Result 537 states and 809 transitions. [2019-11-15 20:31:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:31:23,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 809 transitions. [2019-11-15 20:31:23,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:23,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 534 states and 802 transitions. [2019-11-15 20:31:23,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-11-15 20:31:23,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-11-15 20:31:23,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 802 transitions. [2019-11-15 20:31:23,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:23,553 INFO L688 BuchiCegarLoop]: Abstraction has 534 states and 802 transitions. [2019-11-15 20:31:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 802 transitions. [2019-11-15 20:31:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 494. [2019-11-15 20:31:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-15 20:31:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-15 20:31:23,576 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-15 20:31:23,576 INFO L591 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-15 20:31:23,576 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:31:23,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 746 transitions. [2019-11-15 20:31:23,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:23,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:23,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:23,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:23,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:31:23,583 INFO L791 eck$LassoCheckResult]: Stem: 4807#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 4808#L25 call main_#t~ret2 := fibo(main_~x~0);< 4846#fiboENTRY ~n := #in~n; 4869#L6 assume !(~n < 1); 4868#L8 assume !(1 == ~n); 4864#L11 call #t~ret0 := fibo(~n - 1);< 4867#fiboENTRY ~n := #in~n; 4866#L6 assume !(~n < 1); 4865#L8 assume !(1 == ~n); 4860#L11 call #t~ret0 := fibo(~n - 1);< 4862#fiboENTRY ~n := #in~n; 4863#L6 assume !(~n < 1); 4859#L8 assume !(1 == ~n); 4811#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4857#L6 assume !(~n < 1); 4861#L8 assume !(1 == ~n); 4810#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4858#L6 assume !(~n < 1); 4809#L8 assume 1 == ~n;#res := 1; 4812#fiboFINAL assume true; 4951#fiboEXIT >#32#return; 4930#L11-1 call #t~ret1 := fibo(~n - 2);< 4938#fiboENTRY ~n := #in~n; 5030#L6 assume !(~n < 1); 4955#L8 assume !(1 == ~n); 4956#L11 call #t~ret0 := fibo(~n - 1);< 4965#fiboENTRY ~n := #in~n; 5112#L6 assume !(~n < 1); 5035#L8 assume !(1 == ~n); 5036#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-11-15 20:31:23,584 INFO L793 eck$LassoCheckResult]: Loop: 5054#fiboENTRY ~n := #in~n; 5065#L6 assume !(~n < 1); 5062#L8 assume !(1 == ~n); 5051#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-11-15 20:31:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 116207529, now seen corresponding path program 1 times [2019-11-15 20:31:23,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:23,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72889687] [2019-11-15 20:31:23,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:23,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:23,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:23,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72889687] [2019-11-15 20:31:23,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016045757] [2019-11-15 20:31:23,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:23,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:31:23,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:31:23,871 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:23,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2019-11-15 20:31:23,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301712671] [2019-11-15 20:31:23,872 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:23,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-11-15 20:31:23,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:23,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993021390] [2019-11-15 20:31:23,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:23,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:23,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:23,876 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:23,908 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:23,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:23,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:23,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:23,909 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:23,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:23,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:23,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:23,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration6_Loop [2019-11-15 20:31:23,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:23,909 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:23,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:23,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:23,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:23,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:23,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:23,967 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:23,967 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:23,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:23,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:23,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:23,978 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:23,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:23,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:23,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:23,984 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:23,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:23,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:23,992 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:23,992 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:23,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:23,997 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/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 [2019-11-15 20:31:24,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:24,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:31:24,066 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:24,068 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:24,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:24,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:24,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:24,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:24,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:24,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:24,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:24,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration6_Loop [2019-11-15 20:31:24,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:24,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:24,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:24,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:24,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:24,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:24,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:24,127 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:24,127 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:24,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:24,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:24,128 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:24,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:24,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:24,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:24,129 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:24,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:24,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:24,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:24,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:24,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:24,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:24,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:24,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:24,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:24,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:24,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:24,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:24,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:24,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:24,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:24,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:24,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:24,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:24,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:24,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:24,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:24,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:24,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:24,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:24,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:24,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:24,136 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:24,136 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:24,138 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:24,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:24,140 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:24,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:24,141 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:24,141 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:24,141 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 20:31:24,142 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:24,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 20:31:24,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 20:31:24,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-11-15 20:31:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:31:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 20:31:24,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 20:31:24,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:24,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:24,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 20:31:24,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 20:31:24,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-11-15 20:31:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:31:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 20:31:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 20:31:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:24,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:24,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:24,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:24,691 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 3 loop predicates [2019-11-15 20:31:24,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 20:31:24,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 650 states and 920 transitions. Complement of second has 14 states. [2019-11-15 20:31:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:31:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 20:31:24,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 20:31:24,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:24,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-15 20:31:24,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:24,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 8 letters. [2019-11-15 20:31:24,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:24,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 920 transitions. [2019-11-15 20:31:24,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:24,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 548 states and 806 transitions. [2019-11-15 20:31:24,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-11-15 20:31:24,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2019-11-15 20:31:24,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 806 transitions. [2019-11-15 20:31:24,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:24,829 INFO L688 BuchiCegarLoop]: Abstraction has 548 states and 806 transitions. [2019-11-15 20:31:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 806 transitions. [2019-11-15 20:31:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 518. [2019-11-15 20:31:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-15 20:31:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 770 transitions. [2019-11-15 20:31:24,853 INFO L711 BuchiCegarLoop]: Abstraction has 518 states and 770 transitions. [2019-11-15 20:31:24,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:31:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:31:24,854 INFO L87 Difference]: Start difference. First operand 518 states and 770 transitions. Second operand 20 states. [2019-11-15 20:31:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:25,209 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2019-11-15 20:31:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:31:25,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 871 transitions. [2019-11-15 20:31:25,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:25,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 575 states and 857 transitions. [2019-11-15 20:31:25,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-11-15 20:31:25,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-15 20:31:25,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 857 transitions. [2019-11-15 20:31:25,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:25,231 INFO L688 BuchiCegarLoop]: Abstraction has 575 states and 857 transitions. [2019-11-15 20:31:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 857 transitions. [2019-11-15 20:31:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 541. [2019-11-15 20:31:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-15 20:31:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 807 transitions. [2019-11-15 20:31:25,254 INFO L711 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-15 20:31:25,254 INFO L591 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-15 20:31:25,254 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:31:25,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 807 transitions. [2019-11-15 20:31:25,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:25,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:25,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:25,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 7, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:25,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:31:25,263 INFO L791 eck$LassoCheckResult]: Stem: 8597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8598#L25 call main_#t~ret2 := fibo(main_~x~0);< 8631#fiboENTRY ~n := #in~n; 8671#L6 assume !(~n < 1); 8669#L8 assume !(1 == ~n); 8666#L11 call #t~ret0 := fibo(~n - 1);< 8667#fiboENTRY ~n := #in~n; 8677#L6 assume !(~n < 1); 8676#L8 assume !(1 == ~n); 8653#L11 call #t~ret0 := fibo(~n - 1);< 8675#fiboENTRY ~n := #in~n; 8679#L6 assume !(~n < 1); 8660#L8 assume !(1 == ~n); 8655#L11 call #t~ret0 := fibo(~n - 1);< 8657#fiboENTRY ~n := #in~n; 8711#L6 assume !(~n < 1); 8708#L8 assume !(1 == ~n); 8649#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8721#L6 assume !(~n < 1); 8710#L8 assume !(1 == ~n); 8648#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8730#L6 assume !(~n < 1); 8796#L8 assume 1 == ~n;#res := 1; 8794#fiboFINAL assume true; 8793#fiboEXIT >#32#return; 8785#L11-1 call #t~ret1 := fibo(~n - 2);< 8792#fiboENTRY ~n := #in~n; 9030#L6 assume !(~n < 1); 9006#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8639#fiboENTRY ~n := #in~n; 8640#L6 assume !(~n < 1); 9118#L8 assume !(1 == ~n); 8633#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-11-15 20:31:25,263 INFO L793 eck$LassoCheckResult]: Loop: 8634#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-11-15 20:31:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash -989900256, now seen corresponding path program 2 times [2019-11-15 20:31:25,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:25,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592479939] [2019-11-15 20:31:25,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:25,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:25,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592479939] [2019-11-15 20:31:25,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634859473] [2019-11-15 20:31:25,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:25,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:31:25,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:31:25,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:31:25,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 20:31:25,623 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:25,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 23 [2019-11-15 20:31:25,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107656706] [2019-11-15 20:31:25,624 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-11-15 20:31:25,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:25,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710655847] [2019-11-15 20:31:25,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:25,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:25,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:25,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:25,668 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:25,668 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:25,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:25,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:25,668 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:25,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:25,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:25,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:25,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration7_Loop [2019-11-15 20:31:25,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:25,669 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:25,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:25,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:25,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:25,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:25,734 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:25,734 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:25,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:25,739 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:25,743 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:25,743 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:25,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:25,750 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:25,754 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:25,754 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:25,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:25,760 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:25,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:31:25,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:25,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:25,770 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:25,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:25,782 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:31,922 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:31,924 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:31,924 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:31,924 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:31,924 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:31,924 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:31,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:31,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:31,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:31,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration7_Loop [2019-11-15 20:31:31,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:31,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:31,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:31,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:31,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:31,992 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:31,993 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:31,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:31,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:31,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:31,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:31,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:31,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:31,994 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:31,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:31,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:31,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:31,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:31,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:31,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:31,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:31,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:31,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:31,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:31,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:31,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:31,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:31,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:31,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:31,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:31,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:31,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:31,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:31,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:31,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:31,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:31,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:31,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:31,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:32,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:32,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:32,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:32,002 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:32,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:32,004 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:32,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:32,005 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:32,005 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:32,005 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:31:32,005 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:32,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 20:31:32,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:32,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:32,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:32,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:31:32,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-15 20:31:32,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 556 states and 823 transitions. Complement of second has 18 states. [2019-11-15 20:31:32,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:31:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 20:31:32,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-15 20:31:32,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:32,221 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:32,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 20:31:32,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:32,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:32,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:32,342 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:31:32,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-15 20:31:32,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 786 states and 1145 transitions. Complement of second has 22 states. [2019-11-15 20:31:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:31:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 20:31:32,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-15 20:31:32,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:32,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-15 20:31:32,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:32,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 8 letters. [2019-11-15 20:31:32,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:32,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1145 transitions. [2019-11-15 20:31:32,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 20:31:32,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 719 states and 1073 transitions. [2019-11-15 20:31:32,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-11-15 20:31:32,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-11-15 20:31:32,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 1073 transitions. [2019-11-15 20:31:32,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:32,470 INFO L688 BuchiCegarLoop]: Abstraction has 719 states and 1073 transitions. [2019-11-15 20:31:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 1073 transitions. [2019-11-15 20:31:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 706. [2019-11-15 20:31:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-15 20:31:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1056 transitions. [2019-11-15 20:31:32,497 INFO L711 BuchiCegarLoop]: Abstraction has 706 states and 1056 transitions. [2019-11-15 20:31:32,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 20:31:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-11-15 20:31:32,498 INFO L87 Difference]: Start difference. First operand 706 states and 1056 transitions. Second operand 23 states. [2019-11-15 20:31:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:33,192 INFO L93 Difference]: Finished difference Result 1715 states and 3613 transitions. [2019-11-15 20:31:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:31:33,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1715 states and 3613 transitions. [2019-11-15 20:31:33,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 156 [2019-11-15 20:31:33,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1715 states to 1469 states and 3094 transitions. [2019-11-15 20:31:33,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2019-11-15 20:31:33,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2019-11-15 20:31:33,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1469 states and 3094 transitions. [2019-11-15 20:31:33,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:33,267 INFO L688 BuchiCegarLoop]: Abstraction has 1469 states and 3094 transitions. [2019-11-15 20:31:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states and 3094 transitions. [2019-11-15 20:31:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1302. [2019-11-15 20:31:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-11-15 20:31:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2622 transitions. [2019-11-15 20:31:33,337 INFO L711 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-15 20:31:33,338 INFO L591 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-15 20:31:33,338 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:31:33,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states and 2622 transitions. [2019-11-15 20:31:33,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-15 20:31:33,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:31:33,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:31:33,354 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:33,354 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:31:33,355 INFO L791 eck$LassoCheckResult]: Stem: 13390#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 13391#L25 call main_#t~ret2 := fibo(main_~x~0);< 13443#fiboENTRY ~n := #in~n; 13492#L6 assume !(~n < 1); 13491#L8 assume !(1 == ~n); 13487#L11 call #t~ret0 := fibo(~n - 1);< 13490#fiboENTRY ~n := #in~n; 13489#L6 assume !(~n < 1); 13488#L8 assume !(1 == ~n); 13427#L11 call #t~ret0 := fibo(~n - 1);< 13486#fiboENTRY ~n := #in~n; 13485#L6 assume !(~n < 1); 13484#L8 assume !(1 == ~n); 13480#L11 call #t~ret0 := fibo(~n - 1);< 13483#fiboENTRY ~n := #in~n; 13482#L6 assume !(~n < 1); 13481#L8 assume !(1 == ~n); 13475#L11 call #t~ret0 := fibo(~n - 1);< 13479#fiboENTRY ~n := #in~n; 13477#L6 assume !(~n < 1); 13478#L8 assume !(1 == ~n); 13471#L11 call #t~ret0 := fibo(~n - 1);< 13470#fiboENTRY ~n := #in~n; 13473#L6 assume !(~n < 1); 13476#L8 assume !(1 == ~n); 13472#L11 call #t~ret0 := fibo(~n - 1);< 13517#fiboENTRY ~n := #in~n; 13535#L6 assume !(~n < 1); 13532#L8 assume 1 == ~n;#res := 1; 13529#fiboFINAL assume true; 13525#fiboEXIT >#32#return; 13511#L11-1 call #t~ret1 := fibo(~n - 2);< 13512#fiboENTRY ~n := #in~n; 14574#L6 assume ~n < 1;#res := 0; 14573#fiboFINAL assume true; 14570#fiboEXIT >#34#return; 14569#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14568#fiboFINAL assume true; 14567#fiboEXIT >#32#return; 13440#L11-1 call #t~ret1 := fibo(~n - 2);< 14496#fiboENTRY ~n := #in~n; 14561#L6 assume !(~n < 1); 14535#L8 assume !(1 == ~n); 13448#L11 call #t~ret0 := fibo(~n - 1);< 14103#fiboENTRY ~n := #in~n; 14102#L6 assume !(~n < 1); 14101#L8 assume !(1 == ~n); 13465#L11 call #t~ret0 := fibo(~n - 1);< 13597#fiboENTRY ~n := #in~n; 14081#L6 assume !(~n < 1); 14079#L8 assume !(1 == ~n); 13467#L11 [2019-11-15 20:31:33,355 INFO L793 eck$LassoCheckResult]: Loop: 13467#L11 call #t~ret0 := fibo(~n - 1);< 13597#fiboENTRY ~n := #in~n; 14081#L6 assume !(~n < 1); 14079#L8 assume !(1 == ~n); 13467#L11 [2019-11-15 20:31:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1997475882, now seen corresponding path program 3 times [2019-11-15 20:31:33,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:33,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168186219] [2019-11-15 20:31:33,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:33,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:33,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 20:31:33,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168186219] [2019-11-15 20:31:33,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429411191] [2019-11-15 20:31:33,589 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:33,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 20:31:33,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:31:33,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:31:33,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 19 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:31:33,714 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:33,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 22 [2019-11-15 20:31:33,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858690541] [2019-11-15 20:31:33,715 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:31:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-11-15 20:31:33,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:33,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157038007] [2019-11-15 20:31:33,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:33,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:33,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:31:33,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:31:33,765 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:33,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:33,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:33,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:33,766 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:31:33,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:33,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:33,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:33,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration8_Loop [2019-11-15 20:31:33,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:33,766 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:33,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:33,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:33,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:33,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:33,831 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:33,831 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:33,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:31:33,836 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e144539b-fc26-48cb-89b2-1706cf6a113c/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:31:33,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:31:33,848 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:36,886 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:31:36,888 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:31:36,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:31:36,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:31:36,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:31:36,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:31:36,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:31:36,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:31:36,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:31:36,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-1.c_Iteration8_Loop [2019-11-15 20:31:36,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:31:36,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:31:36,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:36,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:36,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:31:36,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:31:36,946 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:31:36,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:36,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:36,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:36,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:36,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:36,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:36,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:36,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:36,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:36,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:36,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:36,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:36,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:36,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:36,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:36,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:36,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:36,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:36,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:36,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:36,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:36,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:36,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:36,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:36,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:36,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:36,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:31:36,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:31:36,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:31:36,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:31:36,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:31:36,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:31:36,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:31:36,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:31:36,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:31:36,955 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:31:36,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:31:36,956 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:31:36,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:31:36,957 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:31:36,957 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:31:36,957 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:31:36,957 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:31:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:37,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:31:37,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-15 20:31:37,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1324 states and 2645 transitions. Complement of second has 18 states. [2019-11-15 20:31:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:31:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 20:31:37,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 20:31:37,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:37,186 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:37,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:31:37,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-15 20:31:37,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1505 states and 2854 transitions. Complement of second has 22 states. [2019-11-15 20:31:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:31:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 20:31:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 20:31:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:37,437 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:31:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:37,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:31:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:37,616 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 4 loop predicates [2019-11-15 20:31:37,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-15 20:31:37,717 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1635 states and 3078 transitions. Complement of second has 27 states. [2019-11-15 20:31:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:31:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:31:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 20:31:37,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 20:31:37,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:37,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-15 20:31:37,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:37,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 8 letters. [2019-11-15 20:31:37,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:31:37,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1635 states and 3078 transitions. [2019-11-15 20:31:37,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-15 20:31:37,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1635 states to 1302 states and 2622 transitions. [2019-11-15 20:31:37,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2019-11-15 20:31:37,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-11-15 20:31:37,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1302 states and 2622 transitions. [2019-11-15 20:31:37,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:31:37,779 INFO L688 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-15 20:31:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states and 2622 transitions. [2019-11-15 20:31:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2019-11-15 20:31:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-11-15 20:31:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2622 transitions. [2019-11-15 20:31:37,860 INFO L711 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-15 20:31:37,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:31:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:31:37,861 INFO L87 Difference]: Start difference. First operand 1302 states and 2622 transitions. Second operand 22 states. [2019-11-15 20:31:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:38,254 INFO L93 Difference]: Finished difference Result 400 states and 513 transitions. [2019-11-15 20:31:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:31:38,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 513 transitions. [2019-11-15 20:31:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:31:38,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 0 states and 0 transitions. [2019-11-15 20:31:38,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:31:38,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:31:38,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:31:38,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:31:38,259 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:31:38,260 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:31:38,260 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:31:38,260 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:31:38,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:31:38,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:31:38,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:31:38,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:31:38 BoogieIcfgContainer [2019-11-15 20:31:38,268 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:31:38,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:31:38,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:31:38,268 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:31:38,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:31:16" (3/4) ... [2019-11-15 20:31:38,272 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:31:38,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:31:38,274 INFO L168 Benchmark]: Toolchain (without parser) took 21959.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 946.1 MB in the beginning and 988.1 MB in the end (delta: -42.0 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:38,275 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:31:38,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:38,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:31:38,280 INFO L168 Benchmark]: Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:31:38,281 INFO L168 Benchmark]: RCFGBuilder took 236.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:38,282 INFO L168 Benchmark]: BuchiAutomizer took 21361.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 988.1 MB in the end (delta: 130.9 MB). Peak memory consumption was 192.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:38,282 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 988.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:31:38,290 INFO L335 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21361.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 988.1 MB in the end (delta: 130.9 MB). Peak memory consumption was 192.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 988.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (7 trivial, 3 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One deterministic module has affine ranking function n and consists of 7 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 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.2s and 9 iterations. TraceHistogramMax:11. Analysis of lassos took 14.5s. Construction of modules took 1.7s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 442 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1302 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 242 SDtfs, 659 SDslu, 475 SDs, 0 SdLazy, 1881 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf98 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf93 smp78 dnf100 smp100 tf109 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...