./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:19,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:19,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:19,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:19,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:19,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:19,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:19,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:19,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:19,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:19,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:19,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:19,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:19,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:19,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:19,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:19,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:19,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:19,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:19,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:19,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:19,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:19,748 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:19,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:19,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:19,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:19,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:19,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:19,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:19,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:19,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:19,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:19,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:19,760 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:19,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:19,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:19,763 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:10:19,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:19,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:19,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:19,782 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:19,782 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:19,783 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:19,783 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:19,784 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:19,784 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:19,784 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:19,784 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:19,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:19,785 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:10:19,785 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:19,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:19,785 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:19,786 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:19,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:19,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:19,787 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:19,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:19,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:19,787 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:19,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:19,788 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-10-27 06:10:19,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:19,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:19,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:19,854 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:19,854 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:19,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-10-27 06:10:19,902 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/data/74513f44b/e6e2ca32039542538e0b268489d78189/FLAG8ba3d2e0d [2018-10-27 06:10:20,276 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:20,276 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-10-27 06:10:20,282 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/data/74513f44b/e6e2ca32039542538e0b268489d78189/FLAG8ba3d2e0d [2018-10-27 06:10:20,292 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/data/74513f44b/e6e2ca32039542538e0b268489d78189 [2018-10-27 06:10:20,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:20,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:20,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:20,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:20,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:20,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ed68ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20, skipping insertion in model container [2018-10-27 06:10:20,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:20,327 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:20,454 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:20,457 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:20,470 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:20,480 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:20,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20 WrapperNode [2018-10-27 06:10:20,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:20,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:20,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:20,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:20,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:20,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:20,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:20,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:20,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:20,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:20,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:20,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:20,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-10-27 06:10:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-10-27 06:10:20,821 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:20,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:20 BoogieIcfgContainer [2018-10-27 06:10:20,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:20,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:20,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:20,826 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:20,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:20,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:20" (1/3) ... [2018-10-27 06:10:20,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41237456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:20, skipping insertion in model container [2018-10-27 06:10:20,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:20,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (2/3) ... [2018-10-27 06:10:20,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41237456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:20, skipping insertion in model container [2018-10-27 06:10:20,830 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:20,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:20" (3/3) ... [2018-10-27 06:10:20,831 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-10-27 06:10:20,885 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:20,885 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:20,885 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:20,886 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:20,886 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:20,886 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:20,886 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:20,886 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:20,886 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:20,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-10-27 06:10:20,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:20,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:20,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:20,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:10:20,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:20,934 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:20,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-10-27 06:10:20,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:20,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:20,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:20,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:10:20,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:20,944 INFO L793 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-10-27 06:10:20,945 INFO L795 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(~n == 1); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-10-27 06:10:20,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:20,950 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-10-27 06:10:20,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:20,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-10-27 06:10:21,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-10-27 06:10:21,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,270 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:21,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:21,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:21,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:21,272 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:21,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:21,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:21,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-10-27 06:10:21,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:21,273 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:21,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,528 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:21,529 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:10:21,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:21,538 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,549 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:21,550 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:21,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:21,572 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:21,572 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:21,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:21,603 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:21,603 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:21,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:21,630 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:21,630 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:21,647 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:21,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:21,689 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:21,690 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:21,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:21,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:21,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:21,691 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:21,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:21,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:21,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-10-27 06:10:21,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:21,692 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,835 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:21,840 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:21,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:21,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:21,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:21,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:21,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:21,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:21,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:21,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:21,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:21,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:21,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:21,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:21,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:21,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:21,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:21,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:21,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:21,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:21,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:21,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:21,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:21,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:21,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:21,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:21,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:21,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:21,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:21,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:21,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:21,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:21,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:21,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:21,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:21,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:21,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:21,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:21,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:21,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:21,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:21,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:21,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:21,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:21,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:21,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:21,876 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:21,880 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:21,881 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:21,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:21,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:21,883 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:21,883 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-10-27 06:10:21,886 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:22,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:22,354 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 [2018-10-27 06:10:22,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-10-27 06:10:22,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-10-27 06:10:22,504 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 [2018-10-27 06:10:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-10-27 06:10:22,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-10-27 06:10:22,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-10-27 06:10:22,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-10-27 06:10:22,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-10-27 06:10:22,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:22,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-10-27 06:10:22,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:10:22,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:10:22,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-10-27 06:10:22,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:22,523 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-10-27 06:10:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-10-27 06:10:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-27 06:10:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:10:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-27 06:10:22,555 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-27 06:10:22,555 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-27 06:10:22,555 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:22,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-10-27 06:10:22,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:22,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:22,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:22,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,559 INFO L793 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(~n == 1); 123#L11 call #t~ret0 := fibo(~n - 1);< 133#fiboENTRY ~n := #in~n; 134#L6 assume ~n < 1;#res := 0; 129#fiboFINAL assume true; 122#fiboEXIT >#33#return; 124#L11-1 [2018-10-27 06:10:22,559 INFO L795 eck$LassoCheckResult]: Loop: 124#L11-1 call #t~ret1 := fibo(~n - 2);< 138#fiboENTRY ~n := #in~n; 141#L6 assume !(~n < 1); 140#L8 assume !(~n == 1); 136#L11 call #t~ret0 := fibo(~n - 1);< 138#fiboENTRY ~n := #in~n; 141#L6 assume ~n < 1;#res := 0; 137#fiboFINAL assume true; 139#fiboEXIT >#33#return; 124#L11-1 [2018-10-27 06:10:22,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-10-27 06:10:22,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:10:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:22,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:22,726 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:22,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-10-27 06:10:22,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,870 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2018-10-27 06:10:23,029 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-27 06:10:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:10:23,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:23,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:23,050 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:23,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:10:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:10:23,053 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-10-27 06:10:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:23,199 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-27 06:10:23,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:10:23,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-10-27 06:10:23,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:23,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-10-27 06:10:23,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:10:23,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:10:23,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-10-27 06:10:23,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:23,204 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-27 06:10:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-10-27 06:10:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 06:10:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:10:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-27 06:10:23,209 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-27 06:10:23,209 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-27 06:10:23,209 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:23,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-10-27 06:10:23,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:10:23,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:23,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:23,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,211 INFO L793 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(~n == 1); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume ~n == 1;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-10-27 06:10:23,211 INFO L795 eck$LassoCheckResult]: Loop: 189#L11-1 call #t~ret1 := fibo(~n - 2);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume !(~n == 1); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume ~n == 1;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-10-27 06:10:23,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-10-27 06:10:23,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:23,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:23,269 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:23,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-27 06:10:23,308 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:23,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,308 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-10-27 06:10:23,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,458 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:23,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:23,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:23,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:23,458 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:23,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:23,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:23,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:23,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-10-27 06:10:23,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:23,459 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:23,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:23,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:23,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:23,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:23,545 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:23,545 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:23,548 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:23,548 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:23,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:23,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:24,525 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:24,527 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:24,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:24,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:24,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:24,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:24,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:24,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:24,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:24,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-10-27 06:10:24,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:24,528 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:24,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,628 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:24,628 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:24,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:24,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:24,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:24,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:24,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:24,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:24,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:24,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:24,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:24,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:24,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:24,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:24,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:24,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:24,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:24,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:24,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:24,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:24,652 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:24,652 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:24,653 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:24,653 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:24,653 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:24,653 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:24,654 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:24,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:24,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:24,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:24,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-10-27 06:10:24,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:10:25,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-10-27 06:10:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-10-27 06:10:25,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:10:25,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-10-27 06:10:25,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-10-27 06:10:25,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-10-27 06:10:25,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:10:25,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-10-27 06:10:25,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-10-27 06:10:25,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-10-27 06:10:25,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-10-27 06:10:25,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:25,036 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-10-27 06:10:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-10-27 06:10:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-10-27 06:10:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 06:10:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-10-27 06:10:25,050 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-10-27 06:10:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:10:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:10:25,050 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-10-27 06:10:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:25,118 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-27 06:10:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:25,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-10-27 06:10:25,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:10:25,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-10-27 06:10:25,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-10-27 06:10:25,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-10-27 06:10:25,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-10-27 06:10:25,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:25,128 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-10-27 06:10:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-10-27 06:10:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-10-27 06:10:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 06:10:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-10-27 06:10:25,138 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-10-27 06:10:25,138 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-10-27 06:10:25,139 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:25,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-10-27 06:10:25,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:10:25,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:25,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:25,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:25,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:25,143 INFO L793 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(~n == 1); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume ~n == 1;#res := 1; 773#fiboFINAL assume true; 772#fiboEXIT >#33#return; 729#L11-1 call #t~ret1 := fibo(~n - 2);< 771#fiboENTRY ~n := #in~n; 801#L6 assume ~n < 1;#res := 0; 800#fiboFINAL assume true; 799#fiboEXIT >#35#return; 798#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-10-27 06:10:25,143 INFO L795 eck$LassoCheckResult]: Loop: 723#L11-1 call #t~ret1 := fibo(~n - 2);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume !(~n == 1); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume ~n == 1;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-10-27 06:10:25,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-10-27 06:10:25,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:25,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:25,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:25,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:25,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:10:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:25,231 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:10:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-27 06:10:25,278 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:25,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-10-27 06:10:25,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:25,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:25,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:25,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:25,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:25,391 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:25,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:25,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:25,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:25,391 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:25,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:25,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:25,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:25,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-10-27 06:10:25,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:25,392 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,428 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:25,428 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:25,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:25,431 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:25,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:25,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:26,414 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:26,416 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:26,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:26,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:26,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:26,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:26,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:26,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:26,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:26,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-10-27 06:10:26,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:26,418 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:26,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,467 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:26,467 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:26,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,495 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:26,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:26,498 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:26,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:26,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:26,499 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:26,499 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:26,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:26,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:26,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-10-27 06:10:26,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-10-27 06:10:26,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-10-27 06:10:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-10-27 06:10:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-10-27 06:10:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:26,809 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:26,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-10-27 06:10:26,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-10-27 06:10:27,046 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-10-27 06:10:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:10:27,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-10-27 06:10:27,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,050 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:27,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:27,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:27,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:27,435 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-10-27 06:10:27,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-10-27 06:10:27,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-10-27 06:10:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-10-27 06:10:27,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-10-27 06:10:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-10-27 06:10:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-10-27 06:10:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-10-27 06:10:27,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-10-27 06:10:27,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-10-27 06:10:27,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-10-27 06:10:27,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-10-27 06:10:27,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-10-27 06:10:27,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:27,638 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-10-27 06:10:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-10-27 06:10:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-10-27 06:10:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-27 06:10:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-10-27 06:10:27,677 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-10-27 06:10:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:10:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:10:27,678 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-10-27 06:10:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:28,146 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-10-27 06:10:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:10:28,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-10-27 06:10:28,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-10-27 06:10:28,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-10-27 06:10:28,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-10-27 06:10:28,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-10-27 06:10:28,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-10-27 06:10:28,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:28,179 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-10-27 06:10:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-10-27 06:10:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-10-27 06:10:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-27 06:10:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-10-27 06:10:28,219 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-10-27 06:10:28,219 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-10-27 06:10:28,220 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:28,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-10-27 06:10:28,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:10:28,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:28,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:28,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:28,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:28,225 INFO L793 eck$LassoCheckResult]: Stem: 3582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3581#L25 call main_#t~ret2 := fibo(main_~x~0);< 3622#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3633#L8 assume !(~n == 1); 3629#L11 call #t~ret0 := fibo(~n - 1);< 3631#fiboENTRY ~n := #in~n; 3632#L6 assume !(~n < 1); 3628#L8 assume !(~n == 1); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3627#L6 assume !(~n < 1); 3630#L8 assume !(~n == 1); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3626#L6 assume !(~n < 1); 3583#L8 assume ~n == 1;#res := 1; 3586#fiboFINAL assume true; 3676#fiboEXIT >#33#return; 3652#L11-1 call #t~ret1 := fibo(~n - 2);< 3661#fiboENTRY ~n := #in~n; 3720#L6 assume !(~n < 1); 3712#L8 assume !(~n == 1); 3714#L11 call #t~ret0 := fibo(~n - 1);< 3913#fiboENTRY ~n := #in~n; 3918#L6 assume !(~n < 1); 3915#L8 assume !(~n == 1); 3916#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-10-27 06:10:28,225 INFO L795 eck$LassoCheckResult]: Loop: 3925#fiboENTRY ~n := #in~n; 3932#L6 assume !(~n < 1); 3931#L8 assume !(~n == 1); 3922#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-10-27 06:10:28,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-10-27 06:10:28,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:28,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:28,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 06:10:28,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:28,365 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:28,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:10:28,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:28,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-10-27 06:10:28,480 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-10-27 06:10:28,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:28,516 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:28,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:28,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:28,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:28,516 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:28,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:28,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:28,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-10-27 06:10:28,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:28,517 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:28,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,545 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:28,545 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:28,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:28,553 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:28,553 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:28,571 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:28,594 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:28,615 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:28,617 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:28,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:28,617 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:28,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:28,617 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:28,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:28,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:28,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-10-27 06:10:28,618 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:28,618 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:28,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,715 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:28,715 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:28,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:28,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:28,721 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:28,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:28,721 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:28,721 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:28,721 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-10-27 06:10:28,721 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:28,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:28,827 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 [2018-10-27 06:10:28,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-10-27 06:10:29,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-10-27 06:10:29,057 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 [2018-10-27 06:10:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:10:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-10-27 06:10:29,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-10-27 06:10:29,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:29,058 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:29,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:29,179 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 [2018-10-27 06:10:29,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-10-27 06:10:29,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-10-27 06:10:29,361 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 [2018-10-27 06:10:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:10:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-10-27 06:10:29,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-10-27 06:10:29,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:29,362 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:29,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:29,592 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 [2018-10-27 06:10:29,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-10-27 06:10:29,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-10-27 06:10:29,658 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 [2018-10-27 06:10:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:10:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-10-27 06:10:29,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-10-27 06:10:29,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:29,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-10-27 06:10:29,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:29,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-10-27 06:10:29,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:29,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-10-27 06:10:29,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-10-27 06:10:29,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-10-27 06:10:29,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-10-27 06:10:29,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-10-27 06:10:29,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-10-27 06:10:29,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:29,680 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-10-27 06:10:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-10-27 06:10:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-10-27 06:10:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-27 06:10:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-10-27 06:10:29,700 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-10-27 06:10:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:10:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:10:29,701 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-10-27 06:10:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:30,235 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-10-27 06:10:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:10:30,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-10-27 06:10:30,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:30,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-10-27 06:10:30,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-10-27 06:10:30,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-10-27 06:10:30,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-10-27 06:10:30,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:30,247 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-10-27 06:10:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-10-27 06:10:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-10-27 06:10:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-27 06:10:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-10-27 06:10:30,258 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-10-27 06:10:30,259 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-10-27 06:10:30,260 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:30,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-10-27 06:10:30,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:30,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:30,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:30,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:30,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:30,266 INFO L793 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6357#L25 call main_#t~ret2 := fibo(main_~x~0);< 6395#fiboENTRY ~n := #in~n; 6465#L6 assume !(~n < 1); 6464#L8 assume !(~n == 1); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(~n == 1); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(~n == 1); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume ~n == 1;#res := 1; 6550#fiboFINAL assume true; 6549#fiboEXIT >#33#return; 6351#L11-1 call #t~ret1 := fibo(~n - 2);< 6385#fiboENTRY ~n := #in~n; 6553#L6 assume ~n < 1;#res := 0; 6552#fiboFINAL assume true; 6350#fiboEXIT >#35#return; 6352#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6538#fiboFINAL assume true; 6523#fiboEXIT >#33#return; 6374#L11-1 call #t~ret1 := fibo(~n - 2);< 6522#fiboENTRY ~n := #in~n; 6541#L6 assume !(~n < 1); 6396#L8 assume !(~n == 1); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(~n == 1); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-10-27 06:10:30,268 INFO L795 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-10-27 06:10:30,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-10-27 06:10:30,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:30,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-27 06:10:30,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:30,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:30,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:30,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:30,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:30,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 06:10:30,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-10-27 06:10:30,563 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:30,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-10-27 06:10:30,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,595 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:30,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:30,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:30,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:30,595 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:30,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:30,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:30,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:30,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-10-27 06:10:30,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:30,596 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:30,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,632 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:30,632 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/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 [2018-10-27 06:10:30,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:30,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:30,638 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:30,638 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:30,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:30,656 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:30,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:30,677 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:33,129 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:33,131 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:33,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:33,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:33,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:33,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:33,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:33,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:33,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:33,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-10-27 06:10:33,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:33,131 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:33,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,168 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:33,168 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:33,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:33,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:33,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:33,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:33,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:33,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:33,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:33,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:33,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:33,176 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:33,176 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:33,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:33,177 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:33,177 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:33,177 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:33,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:33,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,279 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 [2018-10-27 06:10:33,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-10-27 06:10:33,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-10-27 06:10:33,321 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 [2018-10-27 06:10:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-10-27 06:10:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-10-27 06:10:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:33,322 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:33,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,619 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 [2018-10-27 06:10:33,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-10-27 06:10:33,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-10-27 06:10:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-10-27 06:10:33,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-10-27 06:10:33,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:33,685 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:33,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,936 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 [2018-10-27 06:10:33,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-10-27 06:10:34,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-10-27 06:10:34,141 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 [2018-10-27 06:10:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:10:34,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-10-27 06:10:34,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:34,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-10-27 06:10:34,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:34,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-10-27 06:10:34,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:34,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-10-27 06:10:34,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:34,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-10-27 06:10:34,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-10-27 06:10:34,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-10-27 06:10:34,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-10-27 06:10:34,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:34,152 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-10-27 06:10:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-10-27 06:10:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-10-27 06:10:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-27 06:10:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-10-27 06:10:34,161 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-10-27 06:10:34,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:10:34,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:10:34,163 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-10-27 06:10:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:34,534 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-10-27 06:10:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:10:34,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-10-27 06:10:34,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:34,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-10-27 06:10:34,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-10-27 06:10:34,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-10-27 06:10:34,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-10-27 06:10:34,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:34,542 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-10-27 06:10:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-10-27 06:10:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-10-27 06:10:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-27 06:10:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-10-27 06:10:34,553 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-10-27 06:10:34,553 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-10-27 06:10:34,553 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:34,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-10-27 06:10:34,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:34,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:34,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:34,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-10-27 06:10:34,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:34,560 INFO L793 eck$LassoCheckResult]: Stem: 8578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8567#L25 call main_#t~ret2 := fibo(main_~x~0);< 8615#fiboENTRY ~n := #in~n; 8682#L6 assume !(~n < 1); 8680#L8 assume !(~n == 1); 8677#L11 call #t~ret0 := fibo(~n - 1);< 8678#fiboENTRY ~n := #in~n; 8694#L6 assume !(~n < 1); 8692#L8 assume !(~n == 1); 8688#L11 call #t~ret0 := fibo(~n - 1);< 8691#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8717#L8 assume !(~n == 1); 8684#L11 call #t~ret0 := fibo(~n - 1);< 8689#fiboENTRY ~n := #in~n; 8708#L6 assume !(~n < 1); 8706#L8 assume !(~n == 1); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8749#L6 assume !(~n < 1); 8830#L8 assume ~n == 1;#res := 1; 8825#fiboFINAL assume true; 8824#fiboEXIT >#33#return; 8607#L11-1 call #t~ret1 := fibo(~n - 2);< 8610#fiboENTRY ~n := #in~n; 8781#L6 assume ~n < 1;#res := 0; 8780#fiboFINAL assume true; 8779#fiboEXIT >#35#return; 8777#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8776#fiboFINAL assume true; 8773#fiboEXIT >#33#return; 8729#L11-1 call #t~ret1 := fibo(~n - 2);< 8732#fiboENTRY ~n := #in~n; 8760#L6 assume !(~n < 1); 8754#L8 assume ~n == 1;#res := 1; 8753#fiboFINAL assume true; 8728#fiboEXIT >#35#return; 8726#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8724#fiboFINAL assume true; 8723#fiboEXIT >#33#return; 8697#L11-1 call #t~ret1 := fibo(~n - 2);< 8700#fiboENTRY ~n := #in~n; 8757#L6 assume !(~n < 1); 8755#L8 assume !(~n == 1); 8570#L11 call #t~ret0 := fibo(~n - 1);< 8612#fiboENTRY ~n := #in~n; 8834#L6 assume !(~n < 1); 8581#L8 assume !(~n == 1); 8582#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-10-27 06:10:34,560 INFO L795 eck$LassoCheckResult]: Loop: 8636#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-10-27 06:10:34,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:34,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-10-27 06:10:34,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:34,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:34,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:34,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:34,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-27 06:10:34,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:34,904 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:34,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:10:34,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 06:10:34,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:34,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-27 06:10:34,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:34,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-27 06:10:34,947 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:34,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-10-27 06:10:34,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:34,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:34,984 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:34,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:34,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:34,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:34,984 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:34,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:34,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:34,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-10-27 06:10:34,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:34,985 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:34,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:35,023 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:35,024 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:35,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:35,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:35,031 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:35,031 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:35,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:35,049 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:35,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:35,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:36,136 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:36,137 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:36,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:36,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:36,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:36,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:36,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:36,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:36,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:36,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-10-27 06:10:36,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:36,138 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:36,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,183 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:36,183 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:36,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:36,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:36,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:36,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:36,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:36,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:36,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:36,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:36,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:36,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:36,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:36,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:36,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:36,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:36,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:36,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:36,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:36,195 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:36,196 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:36,196 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:36,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:36,197 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:36,197 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:36,197 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:36,197 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:36,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,301 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 [2018-10-27 06:10:36,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-10-27 06:10:36,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 298 states and 400 transitions. Complement of second has 18 states. [2018-10-27 06:10:36,346 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 [2018-10-27 06:10:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-10-27 06:10:36,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-10-27 06:10:36,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,347 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:36,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,528 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 [2018-10-27 06:10:36,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-10-27 06:10:36,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 304 states and 406 transitions. Complement of second has 17 states. [2018-10-27 06:10:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-10-27 06:10:36,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-10-27 06:10:36,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,590 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:36,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,728 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 [2018-10-27 06:10:36,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-10-27 06:10:36,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 362 states and 482 transitions. Complement of second has 27 states. [2018-10-27 06:10:36,773 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 [2018-10-27 06:10:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:10:36,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-10-27 06:10:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-10-27 06:10:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-10-27 06:10:36,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-10-27 06:10:36,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:36,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-10-27 06:10:36,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-10-27 06:10:36,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-10-27 06:10:36,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-10-27 06:10:36,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,786 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-10-27 06:10:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-10-27 06:10:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-10-27 06:10:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-27 06:10:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-10-27 06:10:36,796 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-10-27 06:10:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:10:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:10:36,797 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 11 states. [2018-10-27 06:10:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:37,337 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2018-10-27 06:10:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:10:37,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 574 transitions. [2018-10-27 06:10:37,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:37,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 378 states and 548 transitions. [2018-10-27 06:10:37,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-10-27 06:10:37,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-10-27 06:10:37,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 548 transitions. [2018-10-27 06:10:37,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:37,349 INFO L705 BuchiCegarLoop]: Abstraction has 378 states and 548 transitions. [2018-10-27 06:10:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 548 transitions. [2018-10-27 06:10:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 321. [2018-10-27 06:10:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-27 06:10:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-10-27 06:10:37,362 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-10-27 06:10:37,362 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-10-27 06:10:37,362 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:37,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 463 transitions. [2018-10-27 06:10:37,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:37,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:37,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:37,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 11, 10, 9, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2018-10-27 06:10:37,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:37,368 INFO L793 eck$LassoCheckResult]: Stem: 11440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11439#L25 call main_#t~ret2 := fibo(main_~x~0);< 11473#fiboENTRY ~n := #in~n; 11554#L6 assume !(~n < 1); 11552#L8 assume !(~n == 1); 11549#L11 call #t~ret0 := fibo(~n - 1);< 11550#fiboENTRY ~n := #in~n; 11565#L6 assume !(~n < 1); 11563#L8 assume !(~n == 1); 11560#L11 call #t~ret0 := fibo(~n - 1);< 11561#fiboENTRY ~n := #in~n; 11571#L6 assume !(~n < 1); 11570#L8 assume !(~n == 1); 11556#L11 call #t~ret0 := fibo(~n - 1);< 11569#fiboENTRY ~n := #in~n; 11584#L6 assume !(~n < 1); 11582#L8 assume !(~n == 1); 11493#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11580#L6 assume !(~n < 1); 11686#L8 assume ~n == 1;#res := 1; 11685#fiboFINAL assume true; 11683#fiboEXIT >#33#return; 11681#L11-1 call #t~ret1 := fibo(~n - 2);< 11682#fiboENTRY ~n := #in~n; 11688#L6 assume ~n < 1;#res := 0; 11687#fiboFINAL assume true; 11680#fiboEXIT >#35#return; 11677#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11676#fiboFINAL assume true; 11674#fiboEXIT >#33#return; 11662#L11-1 call #t~ret1 := fibo(~n - 2);< 11664#fiboENTRY ~n := #in~n; 11691#L6 assume !(~n < 1); 11673#L8 assume ~n == 1;#res := 1; 11478#fiboFINAL assume true; 11661#fiboEXIT >#35#return; 11658#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11657#fiboFINAL assume true; 11635#fiboEXIT >#33#return; 11636#L11-1 call #t~ret1 := fibo(~n - 2);< 11641#fiboENTRY ~n := #in~n; 11675#L6 assume !(~n < 1); 11672#L8 assume !(~n == 1); 11442#L11 call #t~ret0 := fibo(~n - 1);< 11702#fiboENTRY ~n := #in~n; 11472#L6 assume !(~n < 1); 11441#L8 assume ~n == 1;#res := 1; 11444#fiboFINAL assume true; 11752#fiboEXIT >#33#return; 11649#L11-1 call #t~ret1 := fibo(~n - 2);< 11651#fiboENTRY ~n := #in~n; 11653#L6 assume ~n < 1;#res := 0; 11652#fiboFINAL assume true; 11648#fiboEXIT >#35#return; 11646#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11643#fiboFINAL assume true; 11639#fiboEXIT >#35#return; 11568#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11573#fiboFINAL assume true; 11566#fiboEXIT >#33#return; 11477#L11-1 call #t~ret1 := fibo(~n - 2);< 11488#fiboENTRY ~n := #in~n; 11486#L6 assume !(~n < 1); 11474#L8 assume !(~n == 1); 11447#L11 call #t~ret0 := fibo(~n - 1);< 11703#fiboENTRY ~n := #in~n; 11751#L6 assume !(~n < 1); 11750#L8 assume !(~n == 1); 11709#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-10-27 06:10:37,368 INFO L795 eck$LassoCheckResult]: Loop: 11708#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-10-27 06:10:37,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1797143672, now seen corresponding path program 4 times [2018-10-27 06:10:37,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 183 proven. 76 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-27 06:10:37,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:37,511 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:37,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:10:37,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:10:37,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:37,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 148 proven. 222 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-27 06:10:37,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:37,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 21 [2018-10-27 06:10:37,662 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 5 times [2018-10-27 06:10:37,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:37,691 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:37,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:37,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:37,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:37,692 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:37,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:37,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:37,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:37,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-10-27 06:10:37,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:37,692 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:37,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,739 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:37,739 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:37,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:37,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:37,747 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:37,747 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:37,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:37,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:37,767 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:10:37,768 INFO L446 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/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:37,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:37,786 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:37,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:37,807 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:38,672 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:38,673 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:38,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:38,674 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:38,674 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:38,674 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:38,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:38,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:38,674 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:38,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-10-27 06:10:38,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:38,674 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:38,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,872 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-27 06:10:38,883 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:38,884 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:38,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,892 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:38,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:38,894 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:38,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:38,894 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:38,894 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:38,894 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:38,894 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:38,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,025 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 [2018-10-27 06:10:39,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-10-27 06:10:39,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 336 states and 479 transitions. Complement of second has 18 states. [2018-10-27 06:10:39,077 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 [2018-10-27 06:10:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-10-27 06:10:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 86 letters. Loop has 4 letters. [2018-10-27 06:10:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,078 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:39,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,231 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 [2018-10-27 06:10:39,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-10-27 06:10:39,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 342 states and 485 transitions. Complement of second has 17 states. [2018-10-27 06:10:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-10-27 06:10:39,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 86 letters. Loop has 4 letters. [2018-10-27 06:10:39,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:39,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,529 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 [2018-10-27 06:10:39,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-10-27 06:10:39,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 399 states and 563 transitions. Complement of second has 27 states. [2018-10-27 06:10:39,601 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 [2018-10-27 06:10:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:10:39,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 4 letters. [2018-10-27 06:10:39,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 90 letters. Loop has 4 letters. [2018-10-27 06:10:39,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 8 letters. [2018-10-27 06:10:39,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 563 transitions. [2018-10-27 06:10:39,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:39,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 321 states and 463 transitions. [2018-10-27 06:10:39,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-10-27 06:10:39,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-10-27 06:10:39,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 463 transitions. [2018-10-27 06:10:39,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:39,618 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-10-27 06:10:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 463 transitions. [2018-10-27 06:10:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-10-27 06:10:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-27 06:10:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-10-27 06:10:39,628 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-10-27 06:10:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 06:10:39,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:10:39,629 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 21 states. [2018-10-27 06:10:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:40,070 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2018-10-27 06:10:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 06:10:40,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 782 transitions. [2018-10-27 06:10:40,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:40,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 504 states and 778 transitions. [2018-10-27 06:10:40,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-10-27 06:10:40,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-10-27 06:10:40,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 778 transitions. [2018-10-27 06:10:40,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:40,085 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 778 transitions. [2018-10-27 06:10:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 778 transitions. [2018-10-27 06:10:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2018-10-27 06:10:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-27 06:10:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-10-27 06:10:40,124 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-10-27 06:10:40,124 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-10-27 06:10:40,124 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:10:40,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 653 transitions. [2018-10-27 06:10:40,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:40,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:40,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:40,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2018-10-27 06:10:40,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:40,128 INFO L793 eck$LassoCheckResult]: Stem: 14879#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14868#L25 call main_#t~ret2 := fibo(main_~x~0);< 14924#fiboENTRY ~n := #in~n; 15008#L6 assume !(~n < 1); 15006#L8 assume !(~n == 1); 15000#L11 call #t~ret0 := fibo(~n - 1);< 15003#fiboENTRY ~n := #in~n; 15004#L6 assume !(~n < 1); 15001#L8 assume !(~n == 1); 14939#L11 call #t~ret0 := fibo(~n - 1);< 14998#fiboENTRY ~n := #in~n; 14996#L6 assume !(~n < 1); 14994#L8 assume !(~n == 1); 14973#L11 call #t~ret0 := fibo(~n - 1);< 14990#fiboENTRY ~n := #in~n; 14989#L6 assume !(~n < 1); 14988#L8 assume !(~n == 1); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(~n == 1); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(~n == 1); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(~n == 1); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(~n == 1); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(~n == 1); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14971#L6 assume !(~n < 1); 15205#L8 assume ~n == 1;#res := 1; 15204#fiboFINAL assume true; 15201#fiboEXIT >#33#return; 15197#L11-1 call #t~ret1 := fibo(~n - 2);< 15198#fiboENTRY ~n := #in~n; 15203#L6 assume ~n < 1;#res := 0; 15200#fiboFINAL assume true; 15196#fiboEXIT >#35#return; 15154#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15153#fiboFINAL assume true; 15152#fiboEXIT >#33#return; 15065#L11-1 call #t~ret1 := fibo(~n - 2);< 15069#fiboENTRY ~n := #in~n; 15217#L6 assume !(~n < 1); 15082#L8 assume ~n == 1;#res := 1; 15080#fiboFINAL assume true; 15064#fiboEXIT >#35#return; 15062#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15060#fiboFINAL assume true; 15038#fiboEXIT >#33#return; 15039#L11-1 call #t~ret1 := fibo(~n - 2);< 15087#fiboENTRY ~n := #in~n; 15086#L6 assume !(~n < 1); 15084#L8 assume !(~n == 1); 15085#L11 call #t~ret0 := fibo(~n - 1);< 15207#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15194#L8 assume ~n == 1;#res := 1; 15190#fiboFINAL assume true; 15159#fiboEXIT >#33#return; 15052#L11-1 call #t~ret1 := fibo(~n - 2);< 15057#fiboENTRY ~n := #in~n; 15078#L6 assume ~n < 1;#res := 0; 15061#fiboFINAL assume true; 15051#fiboEXIT >#35#return; 15055#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15150#fiboFINAL assume true; 15147#fiboEXIT >#35#return; 15145#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14966#fiboFINAL assume true; 14961#fiboEXIT >#33#return; 14949#L11-1 call #t~ret1 := fibo(~n - 2);< 14955#fiboENTRY ~n := #in~n; 14948#L6 assume !(~n < 1); 14950#L8 assume !(~n == 1); 14930#L11 call #t~ret0 := fibo(~n - 1);< 15157#fiboENTRY ~n := #in~n; 15174#L6 assume !(~n < 1); 15173#L8 assume !(~n == 1); 15170#L11 call #t~ret0 := fibo(~n - 1);< 15172#fiboENTRY ~n := #in~n; 15179#L6 assume !(~n < 1); 15177#L8 assume ~n == 1;#res := 1; 15175#fiboFINAL assume true; 15169#fiboEXIT >#33#return; 15163#L11-1 call #t~ret1 := fibo(~n - 2);< 14920#fiboENTRY ~n := #in~n; 15186#L6 assume ~n < 1;#res := 0; 15128#fiboFINAL assume true; 15162#fiboEXIT >#35#return; 15161#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15158#fiboFINAL assume true; 15156#fiboEXIT >#33#return; 15067#L11-1 call #t~ret1 := fibo(~n - 2);< 15070#fiboENTRY ~n := #in~n; 15187#L6 assume !(~n < 1); 15091#L8 assume ~n == 1;#res := 1; 14929#fiboFINAL assume true; 15066#fiboEXIT >#35#return; 15062#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15060#fiboFINAL assume true; 15038#fiboEXIT >#35#return; 15021#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15019#fiboFINAL assume true; 15014#fiboEXIT >#33#return; 14958#L11-1 call #t~ret1 := fibo(~n - 2);< 14940#fiboENTRY ~n := #in~n; 15136#L6 assume !(~n < 1); 15083#L8 assume !(~n == 1); 14871#L11 call #t~ret0 := fibo(~n - 1);< 15208#fiboENTRY ~n := #in~n; 15209#L6 assume !(~n < 1); 15280#L8 assume !(~n == 1); 14882#L11 call #t~ret0 := fibo(~n - 1);< 14923#fiboENTRY ~n := #in~n; 15237#L6 assume !(~n < 1); 15235#L8 assume !(~n == 1); 14881#L11 [2018-10-27 06:10:40,128 INFO L795 eck$LassoCheckResult]: Loop: 14881#L11 call #t~ret0 := fibo(~n - 1);< 14923#fiboENTRY ~n := #in~n; 15237#L6 assume !(~n < 1); 15235#L8 assume !(~n == 1); 14881#L11 [2018-10-27 06:10:40,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1400596499, now seen corresponding path program 5 times [2018-10-27 06:10:40,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 6 times [2018-10-27 06:10:40,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 662415298, now seen corresponding path program 6 times [2018-10-27 06:10:40,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-10-27 06:10:40,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:40,970 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:10:40,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:10:41,051 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-27 06:10:41,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:41,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-10-27 06:10:41,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:41,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-10-27 06:10:41,202 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:41,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:41,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:41,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:41,203 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:10:41,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:41,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:41,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:41,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-10-27 06:10:41,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:41,203 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:41,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,247 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:41,247 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:41,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:10:41,250 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5f6a18-3610-437d-b8dd-b40aab7c2e48/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:41,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:10:41,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:10:43,310 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:10:43,311 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:43,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:43,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:43,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:43,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:43,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:43,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:43,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:43,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-10-27 06:10:43,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:43,312 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:43,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:43,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:43,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:43,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:43,353 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:43,353 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:43,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:43,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:43,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:43,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:43,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:43,359 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:43,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:43,359 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:43,359 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:43,359 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-10-27 06:10:43,359 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:10:43,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:43,563 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 [2018-10-27 06:10:43,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-10-27 06:10:43,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 432 states and 669 transitions. Complement of second has 18 states. [2018-10-27 06:10:43,605 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 [2018-10-27 06:10:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-10-27 06:10:43,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 128 letters. Loop has 4 letters. [2018-10-27 06:10:43,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:43,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:43,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:44,289 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-27 06:10:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:44,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:44,917 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 [2018-10-27 06:10:44,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-10-27 06:10:45,268 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:10:45,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 438 states and 675 transitions. Complement of second has 17 states. [2018-10-27 06:10:45,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-10-27 06:10:45,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 128 letters. Loop has 4 letters. [2018-10-27 06:10:45,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,318 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:45,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:45,618 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 [2018-10-27 06:10:45,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-10-27 06:10:45,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 513 states and 783 transitions. Complement of second has 27 states. [2018-10-27 06:10:45,662 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 [2018-10-27 06:10:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:10:45,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 4 letters. [2018-10-27 06:10:45,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 132 letters. Loop has 4 letters. [2018-10-27 06:10:45,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 8 letters. [2018-10-27 06:10:45,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 783 transitions. [2018-10-27 06:10:45,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:10:45,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 417 states and 653 transitions. [2018-10-27 06:10:45,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-10-27 06:10:45,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-10-27 06:10:45,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 653 transitions. [2018-10-27 06:10:45,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:45,675 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-10-27 06:10:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 653 transitions. [2018-10-27 06:10:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-10-27 06:10:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-27 06:10:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-10-27 06:10:45,690 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-10-27 06:10:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:10:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:10:45,691 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand 25 states. [2018-10-27 06:10:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:46,123 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2018-10-27 06:10:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 06:10:46,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 922 transitions. [2018-10-27 06:10:46,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:46,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 0 states and 0 transitions. [2018-10-27 06:10:46,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:46,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:46,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:46,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:46,130 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:46,130 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:46,130 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:46,131 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:10:46,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:46,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:46,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:46,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:46 BoogieIcfgContainer [2018-10-27 06:10:46,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:46,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:46,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:46,146 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:46,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:20" (3/4) ... [2018-10-27 06:10:46,150 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:46,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:46,151 INFO L168 Benchmark]: Toolchain (without parser) took 25856.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 959.8 MB in the beginning and 877.7 MB in the end (delta: 82.1 MB). Peak memory consumption was 444.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:46,152 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:46,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:46,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.98 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:46,156 INFO L168 Benchmark]: Boogie Preprocessor took 16.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:46,156 INFO L168 Benchmark]: RCFGBuilder took 295.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -229.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:46,156 INFO L168 Benchmark]: BuchiAutomizer took 25321.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.2 GB in the beginning and 877.7 MB in the end (delta: 298.3 MB). Peak memory consumption was 473.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:46,157 INFO L168 Benchmark]: Witness Printer took 6.16 ms. Allocated memory is still 1.4 GB. Free memory is still 877.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:46,159 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.98 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -229.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25321.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.2 GB in the beginning and 877.7 MB in the end (delta: 298.3 MB). Peak memory consumption was 473.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.16 ms. Allocated memory is still 1.4 GB. Free memory is still 877.7 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 16 terminating modules (8 trivial, 2 deterministic, 6 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 nondeterministic module has affine ranking function n and consists of 7 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. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.2s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 14.1s. Construction of modules took 2.8s. Büchi inclusion checks took 7.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 474 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 417 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 355 SDtfs, 976 SDslu, 536 SDs, 0 SdLazy, 1912 SolverSat, 804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...