./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/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 7e40a98558d0111ea95f3ee60a44cc14c7768182 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:10:43,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:10:43,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:10:43,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:10:43,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:10:43,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:10:43,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:10:43,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:10:43,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:10:43,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:10:43,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:10:43,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:10:43,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:10:43,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:10:43,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:10:43,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:10:43,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:10:43,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:10:43,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:10:43,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:10:43,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:10:43,701 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:10:43,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:10:43,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:10:43,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:10:43,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:10:43,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:10:43,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:10:43,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:10:43,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:10:43,705 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:10:43,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:10:43,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:10:43,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:10:43,706 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:10:43,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:10:43,707 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:10:43,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:10:43,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:10:43,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:10:43,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:10:43,716 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:10:43,716 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:10:43,716 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:10:43,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:10:43,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:10:43,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:10:43,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:10:43,719 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:10:43,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:10:43,720 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:10:43,720 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:10:43,720 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:10:43,721 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_509a514f-f9ab-4489-b9d0-832435a22efb/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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-11-28 12:10:43,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:10:43,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:10:43,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:10:43,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:10:43,757 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:10:43,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 12:10:43,793 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/data/b82dd0a66/27d88cec241641e0946dc60d7ab354fe/FLAGa04c02d03 [2018-11-28 12:10:44,190 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:10:44,191 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 12:10:44,195 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/data/b82dd0a66/27d88cec241641e0946dc60d7ab354fe/FLAGa04c02d03 [2018-11-28 12:10:44,205 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/data/b82dd0a66/27d88cec241641e0946dc60d7ab354fe [2018-11-28 12:10:44,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:10:44,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:10:44,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:44,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:10:44,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:10:44,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28035eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44, skipping insertion in model container [2018-11-28 12:10:44,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:10:44,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:10:44,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:44,330 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:10:44,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:44,346 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:10:44,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44 WrapperNode [2018-11-28 12:10:44,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:44,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:44,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:10:44,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:10:44,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:44,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:10:44,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:10:44,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:10:44,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... [2018-11-28 12:10:44,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:10:44,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:10:44,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:10:44,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:10:44,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-28 12:10:44,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-28 12:10:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:10:44,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:10:44,530 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:10:44,530 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 12:10:44,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:44 BoogieIcfgContainer [2018-11-28 12:10:44,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:10:44,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:10:44,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:10:44,533 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:10:44,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:44,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:10:44" (1/3) ... [2018-11-28 12:10:44,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69f7c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:10:44, skipping insertion in model container [2018-11-28 12:10:44,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:44,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:44" (2/3) ... [2018-11-28 12:10:44,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69f7c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:10:44, skipping insertion in model container [2018-11-28 12:10:44,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:44,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:44" (3/3) ... [2018-11-28 12:10:44,536 INFO L375 chiAutomizerObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 12:10:44,583 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:10:44,584 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:10:44,584 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:10:44,584 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:10:44,584 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:10:44,584 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:10:44,584 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:10:44,584 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:10:44,584 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:10:44,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-28 12:10:44,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:44,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:44,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:44,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:10:44,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:10:44,616 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:10:44,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-28 12:10:44,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:44,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:44,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:44,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:10:44,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:10:44,625 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2018-11-28 12:10:44,625 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2018-11-28 12:10:44,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2018-11-28 12:10:44,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:44,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2018-11-28 12:10:44,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:44,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:44,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:44,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2018-11-28 12:10:44,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:44,774 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:44,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:44,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:44,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:44,775 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:44,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:44,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:44,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-28 12:10:44,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:44,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:44,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:44,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:44,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:44,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:44,857 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:44,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:44,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:44,882 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:44,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:44,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:44,908 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:44,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:44,927 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:44,927 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:44,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:44,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:44,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:44,966 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:44,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:44,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:45,002 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:45,003 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:45,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:45,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:45,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:45,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:45,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:45,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:45,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:45,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-28 12:10:45,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:45,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:45,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:45,092 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:45,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:45,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:45,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:45,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:45,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:45,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:45,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:45,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:45,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:45,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:45,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:45,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:45,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:45,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:45,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:45,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:45,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:45,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:45,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:45,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:45,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:45,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:45,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:45,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:45,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:45,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:45,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:45,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:45,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:45,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:45,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:45,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:45,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:45,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:45,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:45,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:45,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:45,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:45,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:45,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:45,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:45,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:45,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:45,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:45,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:45,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:45,118 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:45,119 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:45,119 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:45,119 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:45,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-11-28 12:10:45,120 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:45,190 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-11-28 12:10:45,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-11-28 12:10:45,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-11-28 12:10:45,254 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-11-28 12:10:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:10:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:10:45,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 12:10:45,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:45,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:10:45,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:45,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 12:10:45,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:45,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-28 12:10:45,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:45,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2018-11-28 12:10:45,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:10:45,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:10:45,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-28 12:10:45,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:45,269 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 12:10:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-28 12:10:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-28 12:10:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:10:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-28 12:10:45,288 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 12:10:45,288 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 12:10:45,288 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:10:45,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-28 12:10:45,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:45,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:45,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:45,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:45,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:45,290 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2018-11-28 12:10:45,290 INFO L796 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2018-11-28 12:10:45,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2018-11-28 12:10:45,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:10:45,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:45,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:10:45,367 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2018-11-28 12:10:45,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:10:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:45,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:10:45,393 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:10:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:10:45,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:10:45,396 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 12:10:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:45,448 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-28 12:10:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:10:45,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-28 12:10:45,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:45,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-28 12:10:45,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 12:10:45,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 12:10:45,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-28 12:10:45,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:45,451 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:10:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-28 12:10:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 12:10:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 12:10:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-28 12:10:45,453 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:10:45,453 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:10:45,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:10:45,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-28 12:10:45,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:10:45,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:45,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:45,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:45,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:45,454 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 184#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 191#fibonacciENTRY ~n := #in~n; 188#L15 assume !(~n < 1); 189#L17 assume !(1 == ~n); 183#L20 call #t~ret0 := fibonacci(~n - 1);< 185#fibonacciENTRY ~n := #in~n; 186#L15 assume !(~n < 1); 187#L17 assume 1 == ~n;#res := 1; 192#fibonacciFINAL assume true; 199#fibonacciEXIT >#28#return; 180#L20-1 [2018-11-28 12:10:45,454 INFO L796 eck$LassoCheckResult]: Loop: 180#L20-1 call #t~ret1 := fibonacci(~n - 2);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume !(1 == ~n); 179#L20 call #t~ret0 := fibonacci(~n - 1);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume 1 == ~n;#res := 1; 196#fibonacciFINAL assume true; 197#fibonacciEXIT >#28#return; 180#L20-1 [2018-11-28 12:10:45,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2018-11-28 12:10:45,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:45,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:45,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:45,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/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-11-28 12:10:45,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:45,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:45,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:10:45,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:45,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 1 times [2018-11-28 12:10:45,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:45,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:45,630 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:45,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:45,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:45,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:45,630 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:45,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:45,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:45,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:45,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-28 12:10:45,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:45,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:45,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:45,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:45,690 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:45,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:45,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:45,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:45,698 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:45,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:45,713 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:45,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:45,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:46,352 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:46,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:46,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:46,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:46,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:46,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:46,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:46,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:46,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:46,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-28 12:10:46,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:46,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:46,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,392 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:46,392 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:46,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:46,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:46,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:46,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:46,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:46,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:46,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:46,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:46,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:46,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:46,401 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:46,401 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:46,401 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:46,401 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:46,402 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-28 12:10:46,402 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:46,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:46,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:46,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:46,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:10:46,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-28 12:10:46,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-11-28 12:10:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:10:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-28 12:10:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 12:10:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-28 12:10:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:46,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-28 12:10:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:46,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-28 12:10:46,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:10:46,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-28 12:10:46,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-28 12:10:46,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:10:46,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-28 12:10:46,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:46,630 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-28 12:10:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-28 12:10:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-28 12:10:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:10:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-28 12:10:46,638 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-28 12:10:46,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:10:46,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:46,639 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-28 12:10:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:46,693 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-28 12:10:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:10:46,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-28 12:10:46,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:10:46,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-28 12:10:46,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-28 12:10:46,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:10:46,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-28 12:10:46,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:46,699 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-28 12:10:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-28 12:10:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-28 12:10:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:10:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-28 12:10:46,708 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-28 12:10:46,708 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-28 12:10:46,708 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:10:46,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-28 12:10:46,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:10:46,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:46,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:46,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:46,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:46,712 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 696#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 711#fibonacciENTRY ~n := #in~n; 709#L15 assume !(~n < 1); 710#L17 assume !(1 == ~n); 695#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 715#L15 assume !(~n < 1); 754#L17 assume 1 == ~n;#res := 1; 753#fibonacciFINAL assume true; 752#fibonacciEXIT >#28#return; 728#L20-1 call #t~ret1 := fibonacci(~n - 2);< 751#fibonacciENTRY ~n := #in~n; 781#L15 assume ~n < 1;#res := 0; 780#fibonacciFINAL assume true; 777#fibonacciEXIT >#30#return; 776#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 774#fibonacciFINAL assume true; 772#fibonacciEXIT >#28#return; 692#L20-1 [2018-11-28 12:10:46,712 INFO L796 eck$LassoCheckResult]: Loop: 692#L20-1 call #t~ret1 := fibonacci(~n - 2);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume !(1 == ~n); 691#L20 call #t~ret0 := fibonacci(~n - 1);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume 1 == ~n;#res := 1; 717#fibonacciFINAL assume true; 770#fibonacciEXIT >#28#return; 692#L20-1 [2018-11-28 12:10:46,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:46,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2018-11-28 12:10:46,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:46,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:46,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:10:46,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:46,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:10:46,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:46,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:10:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 12:10:46,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:46,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 2 times [2018-11-28 12:10:46,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:46,891 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:46,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:46,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:46,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:46,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:46,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:46,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:46,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:46,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-28 12:10:46,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:46,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:46,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:46,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:46,924 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/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-11-28 12:10:46,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:46,926 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:46,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:46,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:47,239 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:47,241 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:47,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:47,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:47,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:47,241 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:47,241 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:47,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:47,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:47,241 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-28 12:10:47,241 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:47,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:47,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:47,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:47,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:47,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:47,271 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:47,271 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:47,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:47,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:47,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:47,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:47,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:47,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:47,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:47,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:47,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:47,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:47,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:47,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:47,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:47,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:47,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:47,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:47,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:47,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:47,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:47,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:47,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:47,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:47,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:47,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:47,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:47,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:47,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:47,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:47,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:47,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:47,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:47,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:47,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:47,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:47,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:47,282 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:47,284 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:47,284 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:47,284 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:47,284 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:47,284 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:47,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-28 12:10:47,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:47,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:47,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:10:47,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:10:47,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-11-28 12:10:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:10:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-28 12:10:47,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:10:47,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:47,453 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:47,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:47,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:10:47,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:10:47,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-11-28 12:10:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:10:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-28 12:10:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:10:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:47,619 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:47,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:47,697 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:10:47,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:10:47,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-11-28 12:10:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:10:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-28 12:10:47,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:10:47,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:47,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-28 12:10:47,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:47,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-28 12:10:47,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:47,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-28 12:10:47,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 12:10:47,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-28 12:10:47,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-28 12:10:47,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-28 12:10:47,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-28 12:10:47,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:47,890 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-28 12:10:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-28 12:10:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-28 12:10:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-28 12:10:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-28 12:10:47,915 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-28 12:10:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:10:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:10:47,916 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-28 12:10:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:48,092 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-28 12:10:48,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:10:48,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-28 12:10:48,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 12:10:48,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-28 12:10:48,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-28 12:10:48,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-28 12:10:48,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-28 12:10:48,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:48,109 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-28 12:10:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-28 12:10:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-28 12:10:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-28 12:10:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-28 12:10:48,131 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-28 12:10:48,131 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-28 12:10:48,131 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:10:48,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-28 12:10:48,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-28 12:10:48,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:48,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:48,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:48,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:10:48,137 INFO L794 eck$LassoCheckResult]: Stem: 3550#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 3551#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 3552#fibonacciENTRY ~n := #in~n; 3592#L15 assume !(~n < 1); 3591#L17 assume !(1 == ~n); 3587#L20 call #t~ret0 := fibonacci(~n - 1);< 3589#fibonacciENTRY ~n := #in~n; 3590#L15 assume !(~n < 1); 3586#L17 assume !(1 == ~n); 3554#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3584#L15 assume !(~n < 1); 3588#L17 assume !(1 == ~n); 3555#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3585#L15 assume !(~n < 1); 3553#L17 assume 1 == ~n;#res := 1; 3556#fibonacciFINAL assume true; 3627#fibonacciEXIT >#28#return; 3609#L20-1 call #t~ret1 := fibonacci(~n - 2);< 3617#fibonacciENTRY ~n := #in~n; 3726#L15 assume !(~n < 1); 3657#L17 assume !(1 == ~n); 3659#L20 call #t~ret0 := fibonacci(~n - 1);< 3880#fibonacciENTRY ~n := #in~n; 3884#L15 assume !(~n < 1); 3882#L17 assume !(1 == ~n); 3579#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-11-28 12:10:48,137 INFO L796 eck$LassoCheckResult]: Loop: 3582#fibonacciENTRY ~n := #in~n; 3577#L15 assume !(~n < 1); 3581#L17 assume !(1 == ~n); 3578#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-11-28 12:10:48,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1149422575, now seen corresponding path program 1 times [2018-11-28 12:10:48,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:48,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 12:10:48,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:48,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:10:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:10:48,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:48,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-28 12:10:48,268 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:48,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2018-11-28 12:10:48,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:48,288 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:48,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:48,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:48,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:48,288 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:48,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:48,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:48,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:48,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-28 12:10:48,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:48,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:48,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:48,312 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:48,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:48,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:48,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:48,315 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:48,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:48,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:48,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:48,332 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:48,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:48,347 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/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-11-28 12:10:48,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:48,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:48,380 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:48,382 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:48,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:48,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:48,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:48,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:48,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:48,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:48,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:48,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-28 12:10:48,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:48,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:48,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:48,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:48,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:48,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:48,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:48,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:48,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:48,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:48,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:48,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:48,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:48,425 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:48,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:48,426 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:48,427 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:48,427 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:48,427 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:48,427 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-11-28 12:10:48,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:48,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:48,486 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-11-28 12:10:48,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:10:48,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-28 12:10:48,528 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-11-28 12:10:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:10:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 12:10:48,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:10:48,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:48,528 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:48,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:48,603 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-11-28 12:10:48,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:10:48,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-28 12:10:48,639 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-11-28 12:10:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:10:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 12:10:48,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:10:48,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:48,640 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:48,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:48,700 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-11-28 12:10:48,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:10:48,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-11-28 12:10:48,751 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-11-28 12:10:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:10:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 12:10:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:10:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 12:10:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-28 12:10:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:48,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-28 12:10:48,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-28 12:10:48,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-28 12:10:48,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-28 12:10:48,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-28 12:10:48,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-28 12:10:48,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:48,760 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-28 12:10:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-28 12:10:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-28 12:10:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-28 12:10:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-28 12:10:48,769 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-28 12:10:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:10:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:10:48,769 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-28 12:10:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:48,908 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-28 12:10:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:10:48,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-28 12:10:48,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:48,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-28 12:10:48,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-28 12:10:48,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-28 12:10:48,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-28 12:10:48,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:48,913 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-28 12:10:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-28 12:10:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-28 12:10:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-28 12:10:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-28 12:10:48,919 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:10:48,919 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:10:48,919 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:10:48,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-28 12:10:48,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:48,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:48,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:48,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:48,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:10:48,921 INFO L794 eck$LassoCheckResult]: Stem: 6312#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6313#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 6314#fibonacciENTRY ~n := #in~n; 6403#L15 assume !(~n < 1); 6402#L17 assume !(1 == ~n); 6398#L20 call #t~ret0 := fibonacci(~n - 1);< 6401#fibonacciENTRY ~n := #in~n; 6400#L15 assume !(~n < 1); 6399#L17 assume !(1 == ~n); 6393#L20 call #t~ret0 := fibonacci(~n - 1);< 6397#fibonacciENTRY ~n := #in~n; 6395#L15 assume !(~n < 1); 6396#L17 assume !(1 == ~n); 6334#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6387#L15 assume !(~n < 1); 6388#L17 assume 1 == ~n;#res := 1; 6493#fibonacciFINAL assume true; 6492#fibonacciEXIT >#28#return; 6308#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6315#fibonacciENTRY ~n := #in~n; 6307#L15 assume ~n < 1;#res := 0; 6309#fibonacciFINAL assume true; 6495#fibonacciEXIT >#30#return; 6297#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6482#fibonacciFINAL assume true; 6468#fibonacciEXIT >#28#return; 6296#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6466#fibonacciENTRY ~n := #in~n; 6485#L15 assume !(~n < 1); 6336#L17 assume !(1 == ~n); 6320#L20 call #t~ret0 := fibonacci(~n - 1);< 6303#fibonacciENTRY ~n := #in~n; 6382#L15 assume !(~n < 1); 6373#L17 assume !(1 == ~n); 6352#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-11-28 12:10:48,921 INFO L796 eck$LassoCheckResult]: Loop: 6354#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-11-28 12:10:48,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1438652912, now seen corresponding path program 2 times [2018-11-28 12:10:48,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:48,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:48,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:48,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 12:10:48,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:48,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:10:49,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:10:49,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:10:49,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:10:49,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:10:49,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:49,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-28 12:10:49,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2018-11-28 12:10:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:49,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:49,151 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:49,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:49,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:49,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:49,151 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:49,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:49,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:49,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:49,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-11-28 12:10:49,152 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:49,152 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:49,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:49,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:49,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:49,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:49,183 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:49,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:49,188 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:49,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:49,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:50,015 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:50,016 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:50,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:50,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:50,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:50,017 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:50,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:50,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:50,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:50,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-11-28 12:10:50,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:50,017 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:50,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:50,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:50,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:50,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:50,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:50,047 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:50,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:50,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:50,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:50,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:50,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:50,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:50,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:50,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:50,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:50,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:50,052 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:50,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:50,052 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:50,052 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:50,052 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-28 12:10:50,052 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:50,152 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-11-28 12:10:50,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:10:50,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-11-28 12:10:50,184 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-11-28 12:10:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:10:50,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:10:50,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:50,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:50,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:50,260 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-11-28 12:10:50,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:10:50,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-11-28 12:10:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:10:50,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:10:50,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:50,310 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:50,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:50,379 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-11-28 12:10:50,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:10:50,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-11-28 12:10:50,418 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-11-28 12:10:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:10:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:10:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-28 12:10:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-28 12:10:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:50,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-28 12:10:50,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:50,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-28 12:10:50,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-28 12:10:50,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-28 12:10:50,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-28 12:10:50,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:50,425 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-28 12:10:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-28 12:10:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-28 12:10:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-28 12:10:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-28 12:10:50,430 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:10:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 12:10:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:10:50,431 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-28 12:10:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:50,771 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-11-28 12:10:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 12:10:50,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-11-28 12:10:50,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:50,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-11-28 12:10:50,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-28 12:10:50,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-28 12:10:50,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-11-28 12:10:50,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:50,778 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-11-28 12:10:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-11-28 12:10:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-11-28 12:10:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-28 12:10:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-28 12:10:50,786 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:10:50,786 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:10:50,786 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:10:50,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-11-28 12:10:50,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:50,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:50,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:50,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-28 12:10:50,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:10:50,789 INFO L794 eck$LassoCheckResult]: Stem: 8511#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 8512#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 8513#fibonacciENTRY ~n := #in~n; 8603#L15 assume !(~n < 1); 8601#L17 assume !(1 == ~n); 8598#L20 call #t~ret0 := fibonacci(~n - 1);< 8599#fibonacciENTRY ~n := #in~n; 8615#L15 assume !(~n < 1); 8613#L17 assume !(1 == ~n); 8609#L20 call #t~ret0 := fibonacci(~n - 1);< 8612#fibonacciENTRY ~n := #in~n; 8669#L15 assume !(~n < 1); 8666#L17 assume !(1 == ~n); 8605#L20 call #t~ret0 := fibonacci(~n - 1);< 8610#fibonacciENTRY ~n := #in~n; 8630#L15 assume !(~n < 1); 8627#L17 assume !(1 == ~n); 8503#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8722#L15 assume !(~n < 1); 8772#L17 assume 1 == ~n;#res := 1; 8771#fibonacciFINAL assume true; 8769#fibonacciEXIT >#28#return; 8531#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8532#fibonacciENTRY ~n := #in~n; 8764#L15 assume ~n < 1;#res := 0; 8762#fibonacciFINAL assume true; 8760#fibonacciEXIT >#30#return; 8759#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8756#fibonacciFINAL assume true; 8752#fibonacciEXIT >#28#return; 8747#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8749#fibonacciENTRY ~n := #in~n; 8758#L15 assume !(~n < 1); 8754#L17 assume 1 == ~n;#res := 1; 8750#fibonacciFINAL assume true; 8746#fibonacciEXIT >#30#return; 8742#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8740#fibonacciFINAL assume true; 8735#fibonacciEXIT >#28#return; 8618#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8621#fibonacciENTRY ~n := #in~n; 8757#L15 assume !(~n < 1); 8753#L17 assume !(1 == ~n); 8507#L20 call #t~ret0 := fibonacci(~n - 1);< 8501#fibonacciENTRY ~n := #in~n; 8509#L15 assume !(~n < 1); 8510#L17 assume !(1 == ~n); 8551#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-11-28 12:10:50,789 INFO L796 eck$LassoCheckResult]: Loop: 8552#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-11-28 12:10:50,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -570292781, now seen corresponding path program 3 times [2018-11-28 12:10:50,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:50,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 153 proven. 80 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-28 12:10:50,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:50,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:10:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:10:50,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 12:10:50,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:10:50,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-28 12:10:50,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:50,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 24 [2018-11-28 12:10:50,995 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2018-11-28 12:10:50,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:50,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:51,017 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:51,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:51,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:51,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:51,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:10:51,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:51,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:51,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:51,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-11-28 12:10:51,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:51,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:51,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:51,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:51,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:51,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:51,043 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:51,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:51,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:51,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:10:51,047 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:51,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:10:51,062 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509a514f-f9ab-4489-b9d0-832435a22efb/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:51,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:10:51,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:10:52,290 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:10:52,291 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:52,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:52,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:52,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:52,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:52,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:52,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:52,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:52,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-11-28 12:10:52,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:52,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:52,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:52,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-11-28 12:10:52,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:52,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:10:52,321 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:52,321 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:52,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:52,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:52,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:52,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:52,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:52,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:52,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:52,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:52,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:52,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:10:52,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:52,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:52,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:52,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:52,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:52,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:52,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:52,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:52,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:10:52,326 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:10:52,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:52,327 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:10:52,327 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:52,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-28 12:10:52,327 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:10:52,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:52,429 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-11-28 12:10:52,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:10:52,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-11-28 12:10:52,459 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-11-28 12:10:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:10:52,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:10:52,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:52,459 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:52,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:52,548 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-11-28 12:10:52,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:10:52,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-11-28 12:10:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:10:52,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:10:52,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:52,595 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:52,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:52,673 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-11-28 12:10:52,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:10:52,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-11-28 12:10:52,722 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-11-28 12:10:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:10:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:10:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:10:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-11-28 12:10:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:52,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-28 12:10:52,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:52,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-11-28 12:10:52,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:10:52,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-11-28 12:10:52,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-28 12:10:52,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-28 12:10:52,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-11-28 12:10:52,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:52,731 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-11-28 12:10:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-11-28 12:10:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-11-28 12:10:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-28 12:10:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-28 12:10:52,736 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:10:52,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 12:10:52,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:10:52,737 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 24 states. [2018-11-28 12:10:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:53,029 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2018-11-28 12:10:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:10:53,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 595 transitions. [2018-11-28 12:10:53,032 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:10:53,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:10:53,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:10:53,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:53,033 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:10:53,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:10:53,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:10:53,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:10:53,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:10:53 BoogieIcfgContainer [2018-11-28 12:10:53,039 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:10:53,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:10:53,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:10:53,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:10:53,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:44" (3/4) ... [2018-11-28 12:10:53,042 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:10:53,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:10:53,043 INFO L168 Benchmark]: Toolchain (without parser) took 8834.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 953.3 MB in the beginning and 1.0 GB in the end (delta: -66.5 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:53,044 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:53,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.37 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:53,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.37 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:53,045 INFO L168 Benchmark]: Boogie Preprocessor took 9.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:53,045 INFO L168 Benchmark]: RCFGBuilder took 156.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:53,046 INFO L168 Benchmark]: BuchiAutomizer took 8507.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.7 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:53,046 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:53,051 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.37 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.37 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8507.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.7 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 2 deterministic, 4 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. 6 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 5.1s. Construction of modules took 0.8s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 238 SDtfs, 740 SDslu, 328 SDs, 0 SdLazy, 1266 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...