./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/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 fe571d33601eb001defa960d70b02ea99b59263c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:21:16,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:21:16,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:21:16,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:21:16,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:21:16,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:21:16,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:21:16,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:21:16,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:21:16,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:21:16,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:21:16,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:21:16,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:21:16,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:21:16,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:21:16,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:21:16,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:21:16,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:21:16,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:21:16,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:21:16,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:21:16,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:21:16,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:21:16,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:21:16,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:21:16,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:21:16,685 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:21:16,686 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:21:16,687 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:21:16,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:21:16,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:21:16,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:21:16,688 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:21:16,689 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:21:16,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:21:16,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:21:16,690 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:21:16,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:21:16,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:21:16,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:21:16,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:21:16,703 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:21:16,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:21:16,704 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:21:16,704 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:21:16,704 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:21:16,704 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:21:16,704 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:21:16,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:21:16,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:21:16,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:21:16,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:21:16,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:21:16,707 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:21:16,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:21:16,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:21:16,707 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:21:16,708 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:21:16,708 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_7e7519b2-4319-4dc2-84ac-d6f3689921dc/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 -> fe571d33601eb001defa960d70b02ea99b59263c [2018-11-10 11:21:16,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:21:16,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:21:16,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:21:16,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:21:16,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:21:16,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 11:21:16,806 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/data/3eb88d5c4/2c1280ebd2ee4e6c8a4ec4dfc6d6544a/FLAGc799fe79d [2018-11-10 11:21:17,150 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:21:17,151 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 11:21:17,156 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/data/3eb88d5c4/2c1280ebd2ee4e6c8a4ec4dfc6d6544a/FLAGc799fe79d [2018-11-10 11:21:17,166 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/data/3eb88d5c4/2c1280ebd2ee4e6c8a4ec4dfc6d6544a [2018-11-10 11:21:17,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:21:17,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:21:17,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:21:17,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:21:17,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:21:17,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585e7ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17, skipping insertion in model container [2018-11-10 11:21:17,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:21:17,205 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:21:17,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:21:17,339 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:21:17,351 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:21:17,363 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:21:17,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17 WrapperNode [2018-11-10 11:21:17,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:21:17,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:21:17,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:21:17,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:21:17,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:21:17,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:21:17,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:21:17,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:21:17,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... [2018-11-10 11:21:17,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:21:17,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:21:17,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:21:17,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:21:17,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:21:17,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:21:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 11:21:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 11:21:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 11:21:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 11:21:17,607 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:21:17,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:21:17 BoogieIcfgContainer [2018-11-10 11:21:17,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:21:17,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:21:17,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:21:17,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:21:17,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:21:17,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:21:17" (1/3) ... [2018-11-10 11:21:17,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9378330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:21:17, skipping insertion in model container [2018-11-10 11:21:17,612 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:21:17,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:21:17" (2/3) ... [2018-11-10 11:21:17,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9378330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:21:17, skipping insertion in model container [2018-11-10 11:21:17,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:21:17,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:21:17" (3/3) ... [2018-11-10 11:21:17,614 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 11:21:17,657 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:21:17,657 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:21:17,657 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:21:17,657 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:21:17,657 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:21:17,657 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:21:17,658 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:21:17,658 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:21:17,658 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:21:17,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 11:21:17,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:17,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:17,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:17,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 11:21:17,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:17,698 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:21:17,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 11:21:17,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:17,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:17,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:17,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 11:21:17,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:17,712 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 17#L37true call main_#t~ret4 := fibo1(main_~x~0);< 25#fibo1ENTRYtrue [2018-11-10 11:21:17,712 INFO L795 eck$LassoCheckResult]: Loop: 25#fibo1ENTRYtrue ~n := #in~n; 13#L8true assume !(~n < 1); 4#L10true assume !(~n == 1); 19#L13true call #t~ret0 := fibo2(~n - 1);< 11#fibo2ENTRYtrue ~n := #in~n; 28#L18true assume !(~n < 1); 26#L20true assume !(~n == 1); 3#L23true call #t~ret2 := fibo1(~n - 1);< 25#fibo1ENTRYtrue [2018-11-10 11:21:17,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2018-11-10 11:21:17,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:17,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:17,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2018-11-10 11:21:17,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:17,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2018-11-10 11:21:17,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:17,990 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:17,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:17,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:17,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:17,992 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:21:17,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:17,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:17,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:17,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 11:21:17,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:17,993 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:18,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,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-10 11:21:18,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,131 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:18,131 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,144 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,144 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,169 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,169 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,192 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,192 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,220 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,220 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,255 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,256 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,279 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,279 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,303 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,303 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,327 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,327 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,350 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:18,350 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:18,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:21:18,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:18,462 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:21:18,463 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:18,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:18,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:18,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:18,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:21:18,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:18,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:18,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:18,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 11:21:18,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:18,464 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:18,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:18,586 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:18,591 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:21:18,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:18,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:18,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:18,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:18,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:18,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:18,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:18,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:18,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:18,637 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:21:18,642 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:21:18,642 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:21:18,644 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:21:18,644 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:21:18,645 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:21:18,645 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 11:21:18,646 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:21:18,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:18,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:18,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:18,773 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 11:21:18,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 6 states. [2018-11-10 11:21:18,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 6 states. Result 84 states and 116 transitions. Complement of second has 24 states. [2018-11-10 11:21:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 11:21:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-10 11:21:18,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 11:21:18,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:18,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 11:21:18,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:18,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-10 11:21:18,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:18,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2018-11-10 11:21:18,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:18,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2018-11-10 11:21:18,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 11:21:18,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 11:21:18,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2018-11-10 11:21:18,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:18,998 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-10 11:21:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2018-11-10 11:21:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-10 11:21:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 11:21:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 11:21:19,030 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 11:21:19,030 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 11:21:19,031 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:21:19,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2018-11-10 11:21:19,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:19,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:19,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:19,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:19,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:19,035 INFO L793 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 214#L37 call main_#t~ret4 := fibo1(main_~x~0);< 216#fibo1ENTRY ~n := #in~n; 228#L8 assume !(~n < 1); 213#L10 assume !(~n == 1); 205#L13 call #t~ret0 := fibo2(~n - 1);< 221#fibo2ENTRY ~n := #in~n; 248#L18 assume !(~n < 1); 249#L20 assume !(~n == 1); 200#L23 call #t~ret2 := fibo1(~n - 1);< 203#fibo1ENTRY ~n := #in~n; 229#L8 assume ~n < 1;#res := 0; 212#fibo1FINAL assume true; 219#fibo1EXIT >#46#return; 215#L23-1 [2018-11-10 11:21:19,036 INFO L795 eck$LassoCheckResult]: Loop: 215#L23-1 call #t~ret3 := fibo1(~n - 2);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume !(~n < 1); 242#L10 assume !(~n == 1); 198#L13 call #t~ret0 := fibo2(~n - 1);< 222#fibo2ENTRY ~n := #in~n; 241#L18 assume !(~n < 1); 237#L20 assume !(~n == 1); 196#L23 call #t~ret2 := fibo1(~n - 1);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume ~n < 1;#res := 0; 224#fibo1FINAL assume true; 225#fibo1EXIT >#46#return; 215#L23-1 [2018-11-10 11:21:19,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2018-11-10 11:21:19,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:21:19,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:21:19,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:21:19,122 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2018-11-10 11:21:19,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:21:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:21:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:21:19,195 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:21:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:21:19,199 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-10 11:21:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:19,278 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-10 11:21:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:21:19,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-10 11:21:19,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:19,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2018-11-10 11:21:19,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 11:21:19,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 11:21:19,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2018-11-10 11:21:19,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:19,287 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-10 11:21:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2018-11-10 11:21:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-10 11:21:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:21:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-11-10 11:21:19,296 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 11:21:19,296 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 11:21:19,297 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:21:19,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2018-11-10 11:21:19,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:21:19,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:19,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:19,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:19,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:19,302 INFO L793 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 343#L37 call main_#t~ret4 := fibo1(main_~x~0);< 344#fibo1ENTRY ~n := #in~n; 372#L8 assume !(~n < 1); 348#L10 assume !(~n == 1); 339#L13 call #t~ret0 := fibo2(~n - 1);< 358#fibo2ENTRY ~n := #in~n; 388#L18 assume !(~n < 1); 389#L20 assume !(~n == 1); 337#L23 call #t~ret2 := fibo1(~n - 1);< 342#fibo1ENTRY ~n := #in~n; 367#L8 assume !(~n < 1); 383#L10 assume ~n == 1;#res := 1; 382#fibo1FINAL assume true; 378#fibo1EXIT >#46#return; 346#L23-1 [2018-11-10 11:21:19,302 INFO L795 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume !(~n == 1); 335#L13 call #t~ret0 := fibo2(~n - 1);< 381#fibo2ENTRY ~n := #in~n; 386#L18 assume !(~n < 1); 376#L20 assume !(~n == 1); 333#L23 call #t~ret2 := fibo1(~n - 1);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume ~n == 1;#res := 1; 347#fibo1FINAL assume true; 362#fibo1EXIT >#46#return; 346#L23-1 [2018-11-10 11:21:19,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2018-11-10 11:21:19,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:19,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:19,379 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:19,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 11:21:19,424 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:19,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2018-11-10 11:21:19,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:19,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:19,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:19,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:19,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:19,537 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:21:19,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:19,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:19,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:19,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 11:21:19,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:19,537 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:19,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:19,587 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:19,588 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:19,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:19,590 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:19,593 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:19,593 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:19,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:19,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:19,617 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:19,617 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:19,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:19,638 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:19,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:21:19,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:20,677 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:21:20,679 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:20,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:20,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:20,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:20,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:21:20,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:20,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:20,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:20,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 11:21:20,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:20,680 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:20,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:20,732 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:20,732 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:21:20,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:20,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:20,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:20,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:20,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:20,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:20,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:20,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:20,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:20,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:20,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:20,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:20,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:20,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:20,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:20,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:20,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:20,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:20,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:20,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:20,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:20,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:20,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:20,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:20,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:21:20,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:21:20,750 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:21:20,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:21:20,751 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:21:20,751 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:21:20,751 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-10 11:21:20,752 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:21:20,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:20,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:20,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:20,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 11:21:20,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-10 11:21:21,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 191 states and 263 transitions. Complement of second has 26 states. [2018-11-10 11:21:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 11:21:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-10 11:21:21,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-10 11:21:21,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:21,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 30 letters. Loop has 14 letters. [2018-11-10 11:21:21,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:21,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 28 letters. [2018-11-10 11:21:21,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:21,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. [2018-11-10 11:21:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:21:21,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2018-11-10 11:21:21,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 11:21:21,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 11:21:21,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2018-11-10 11:21:21,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:21,141 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2018-11-10 11:21:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2018-11-10 11:21:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-10 11:21:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 11:21:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2018-11-10 11:21:21,158 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2018-11-10 11:21:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:21:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:21:21,158 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand 9 states. [2018-11-10 11:21:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:21,261 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2018-11-10 11:21:21,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:21:21,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 244 transitions. [2018-11-10 11:21:21,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:21:21,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 240 transitions. [2018-11-10 11:21:21,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-10 11:21:21,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-10 11:21:21,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 240 transitions. [2018-11-10 11:21:21,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:21,271 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 240 transitions. [2018-11-10 11:21:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 240 transitions. [2018-11-10 11:21:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-11-10 11:21:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 11:21:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2018-11-10 11:21:21,283 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 11:21:21,283 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 11:21:21,283 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:21:21,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 225 transitions. [2018-11-10 11:21:21,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:21:21,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:21,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:21,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 11:21:21,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 11:21:21,290 INFO L793 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1154#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1155#fibo1ENTRY ~n := #in~n; 1219#L8 assume !(~n < 1); 1218#L10 assume !(~n == 1); 1132#L13 call #t~ret0 := fibo2(~n - 1);< 1164#fibo2ENTRY ~n := #in~n; 1281#L18 assume !(~n < 1); 1280#L20 assume !(~n == 1); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(~n == 1); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume !(~n < 1); 1213#L20 assume !(~n == 1); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(~n == 1); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume ~n < 1;#res := 0; 1211#fibo2FINAL assume true; 1207#fibo2EXIT >#50#return; 1129#L13-1 call #t~ret1 := fibo2(~n - 2);< 1168#fibo2ENTRY ~n := #in~n; 1178#L18 assume !(~n < 1); 1185#L20 assume !(~n == 1); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1217#L8 assume !(~n < 1); 1223#L10 assume ~n == 1;#res := 1; 1222#fibo1FINAL assume true; 1220#fibo1EXIT >#46#return; 1204#L23-1 call #t~ret3 := fibo1(~n - 2);< 1136#fibo1ENTRY ~n := #in~n; 1210#L8 assume !(~n < 1); 1206#L10 assume !(~n == 1); 1134#L13 call #t~ret0 := fibo2(~n - 1);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume ~n < 1;#res := 0; 1201#fibo2FINAL assume true; 1209#fibo2EXIT >#50#return; 1135#L13-1 call #t~ret1 := fibo2(~n - 2);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume !(~n < 1); 1196#L20 assume ~n == 1;#res := 1; 1137#fibo2FINAL assume true; 1138#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 11:21:21,290 INFO L795 eck$LassoCheckResult]: Loop: 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 11:21:21,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 376035563, now seen corresponding path program 1 times [2018-11-10 11:21:21,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-10 11:21:21,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:21,350 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:21,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:21,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 23 proven. 71 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 11:21:21,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2018-11-10 11:21:21,536 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:21,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash 36254641, now seen corresponding path program 1 times [2018-11-10 11:21:21,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:21,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 11:21:21,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:21,578 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:21,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 11:21:21,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:21:21,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 11:21:21,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:21,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:21:21,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:21:21,633 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-10 11:21:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:21,671 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2018-11-10 11:21:21,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:21:21,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 236 transitions. [2018-11-10 11:21:21,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:21:21,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 172 states and 222 transitions. [2018-11-10 11:21:21,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 11:21:21,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 11:21:21,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 222 transitions. [2018-11-10 11:21:21,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:21,680 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 222 transitions. [2018-11-10 11:21:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 222 transitions. [2018-11-10 11:21:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2018-11-10 11:21:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 11:21:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2018-11-10 11:21:21,693 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 11:21:21,693 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 11:21:21,693 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:21:21,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 206 transitions. [2018-11-10 11:21:21,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:21:21,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:21,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:21,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 11:21:21,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:21,701 INFO L793 eck$LassoCheckResult]: Stem: 1935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1910#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1912#fibo1ENTRY ~n := #in~n; 1943#L8 assume !(~n < 1); 1909#L10 assume !(~n == 1); 1911#L13 call #t~ret0 := fibo2(~n - 1);< 1920#fibo2ENTRY ~n := #in~n; 2022#L18 assume !(~n < 1); 2021#L20 assume !(~n == 1); 1925#L23 call #t~ret2 := fibo1(~n - 1);< 1893#fibo1ENTRY ~n := #in~n; 1975#L8 assume !(~n < 1); 1973#L10 assume !(~n == 1); 1891#L13 call #t~ret0 := fibo2(~n - 1);< 1970#fibo2ENTRY ~n := #in~n; 1976#L18 assume !(~n < 1); 1974#L20 assume !(~n == 1); 1890#L23 call #t~ret2 := fibo1(~n - 1);< 1893#fibo1ENTRY ~n := #in~n; 1975#L8 assume !(~n < 1); 1973#L10 assume !(~n == 1); 1891#L13 call #t~ret0 := fibo2(~n - 1);< 1970#fibo2ENTRY ~n := #in~n; 1976#L18 assume !(~n < 1); 1974#L20 assume ~n == 1;#res := 1; 1972#fibo2FINAL assume true; 1969#fibo2EXIT >#50#return; 1892#L13-1 call #t~ret1 := fibo2(~n - 2);< 1926#fibo2ENTRY ~n := #in~n; 1939#L18 assume !(~n < 1); 1945#L20 assume !(~n == 1); 1890#L23 call #t~ret2 := fibo1(~n - 1);< 1893#fibo1ENTRY ~n := #in~n; 1977#L8 assume !(~n < 1); 1981#L10 assume ~n == 1;#res := 1; 1982#fibo1FINAL assume true; 1978#fibo1EXIT >#46#return; 1965#L23-1 call #t~ret3 := fibo1(~n - 2);< 1905#fibo1ENTRY ~n := #in~n; 1971#L8 assume !(~n < 1); 1966#L10 assume !(~n == 1); 1904#L13 call #t~ret0 := fibo2(~n - 1);< 1963#fibo2ENTRY ~n := #in~n; 1961#L18 assume !(~n < 1); 1954#L20 assume ~n == 1;#res := 1; 1955#fibo2FINAL assume true; 2006#fibo2EXIT >#50#return; 1936#L13-1 call #t~ret1 := fibo2(~n - 2);< 1924#fibo2ENTRY ~n := #in~n; 1938#L18 assume ~n < 1;#res := 0; 2020#fibo2FINAL assume true; 2025#fibo2EXIT >#52#return; 1998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2023#fibo1FINAL assume true; 2012#fibo1EXIT >#48#return; 2008#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2004#fibo2FINAL assume true; 1999#fibo2EXIT >#52#return; 1998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2023#fibo1FINAL assume true; 2012#fibo1EXIT >#46#return; 2001#L23-1 call #t~ret3 := fibo1(~n - 2);< 2014#fibo1ENTRY ~n := #in~n; 2033#L8 assume !(~n < 1); 2015#L10 assume !(~n == 1); 1937#L13 call #t~ret0 := fibo2(~n - 1);< 1924#fibo2ENTRY ~n := #in~n; 1938#L18 assume !(~n < 1); 2019#L20 assume ~n == 1;#res := 1; 2017#fibo2FINAL assume true; 2005#fibo2EXIT >#50#return; 1936#L13-1 call #t~ret1 := fibo2(~n - 2);< 1924#fibo2ENTRY ~n := #in~n; 1938#L18 assume ~n < 1;#res := 0; 2020#fibo2FINAL assume true; 2025#fibo2EXIT >#52#return; 1998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2023#fibo1FINAL assume true; 2012#fibo1EXIT >#48#return; 2008#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2004#fibo2FINAL assume true; 1999#fibo2EXIT >#50#return; 1936#L13-1 [2018-11-10 11:21:21,701 INFO L795 eck$LassoCheckResult]: Loop: 1936#L13-1 call #t~ret1 := fibo2(~n - 2);< 1924#fibo2ENTRY ~n := #in~n; 1938#L18 assume !(~n < 1); 2019#L20 assume !(~n == 1); 2000#L23 call #t~ret2 := fibo1(~n - 1);< 2014#fibo1ENTRY ~n := #in~n; 2033#L8 assume !(~n < 1); 2015#L10 assume !(~n == 1); 1937#L13 call #t~ret0 := fibo2(~n - 1);< 1924#fibo2ENTRY ~n := #in~n; 1938#L18 assume !(~n < 1); 2019#L20 assume ~n == 1;#res := 1; 2017#fibo2FINAL assume true; 2005#fibo2EXIT >#50#return; 1936#L13-1 [2018-11-10 11:21:21,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 821073247, now seen corresponding path program 2 times [2018-11-10 11:21:21,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-10 11:21:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:21,905 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:21:21,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:21:21,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:21:21,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-10 11:21:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:22,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-10 11:21:22,004 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:22,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2018-11-10 11:21:22,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:22,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:22,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:22,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:22,116 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:22,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:22,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:22,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:22,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:21:22,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:22,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:22,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 11:21:22,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:22,117 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:22,167 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:22,167 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,193 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,193 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,201 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,201 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,224 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,224 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,248 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,248 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,271 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,271 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:22,294 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:22,294 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:22,315 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:22,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:21:22,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:23,172 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:21:23,174 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:23,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:23,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:23,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:23,174 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:21:23,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:23,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:23,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:23,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 11:21:23,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:23,174 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:23,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:23,233 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:23,234 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:21:23,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:23,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:23,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:23,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:23,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:23,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:23,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:23,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:23,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:23,254 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:21:23,257 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:21:23,257 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:21:23,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:21:23,258 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:21:23,258 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:21:23,258 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-10 11:21:23,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:21:23,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:23,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:23,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:23,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 11:21:23,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 11:21:23,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 880 states and 1168 transitions. Complement of second has 26 states. [2018-11-10 11:21:23,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 11:21:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-11-10 11:21:23,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 11:21:23,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:23,763 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:21:23,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:23,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:23,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:23,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 11:21:23,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 11:21:24,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 670 states and 943 transitions. Complement of second has 24 states. [2018-11-10 11:21:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 11:21:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-10 11:21:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 11:21:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:24,135 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:21:24,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:24,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:24,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:24,313 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 11:21:24,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 11:21:24,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1661 states and 2157 transitions. Complement of second has 90 states. [2018-11-10 11:21:24,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 11:21:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-11-10 11:21:24,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 11:21:24,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:24,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 97 letters. Loop has 14 letters. [2018-11-10 11:21:24,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:24,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 28 letters. [2018-11-10 11:21:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:24,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1661 states and 2157 transitions. [2018-11-10 11:21:24,573 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-10 11:21:24,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1661 states to 1189 states and 1644 transitions. [2018-11-10 11:21:24,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-10 11:21:24,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-10 11:21:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1189 states and 1644 transitions. [2018-11-10 11:21:24,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:24,593 INFO L705 BuchiCegarLoop]: Abstraction has 1189 states and 1644 transitions. [2018-11-10 11:21:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states and 1644 transitions. [2018-11-10 11:21:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1042. [2018-11-10 11:21:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-11-10 11:21:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1431 transitions. [2018-11-10 11:21:24,642 INFO L728 BuchiCegarLoop]: Abstraction has 1042 states and 1431 transitions. [2018-11-10 11:21:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:21:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:21:24,642 INFO L87 Difference]: Start difference. First operand 1042 states and 1431 transitions. Second operand 17 states. [2018-11-10 11:21:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:24,927 INFO L93 Difference]: Finished difference Result 1249 states and 1764 transitions. [2018-11-10 11:21:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 11:21:24,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1249 states and 1764 transitions. [2018-11-10 11:21:24,940 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2018-11-10 11:21:24,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1249 states to 609 states and 745 transitions. [2018-11-10 11:21:24,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-10 11:21:24,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2018-11-10 11:21:24,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 609 states and 745 transitions. [2018-11-10 11:21:24,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:24,947 INFO L705 BuchiCegarLoop]: Abstraction has 609 states and 745 transitions. [2018-11-10 11:21:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 745 transitions. [2018-11-10 11:21:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 591. [2018-11-10 11:21:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-11-10 11:21:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 727 transitions. [2018-11-10 11:21:24,964 INFO L728 BuchiCegarLoop]: Abstraction has 591 states and 727 transitions. [2018-11-10 11:21:24,964 INFO L608 BuchiCegarLoop]: Abstraction has 591 states and 727 transitions. [2018-11-10 11:21:24,964 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:21:24,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 591 states and 727 transitions. [2018-11-10 11:21:24,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-10 11:21:24,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:24,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:24,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:24,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:24,970 INFO L793 eck$LassoCheckResult]: Stem: 8968#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 8925#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8926#fibo1ENTRY ~n := #in~n; 9107#L8 assume !(~n < 1); 9106#L10 assume !(~n == 1); 9103#L13 call #t~ret0 := fibo2(~n - 1);< 9105#fibo2ENTRY ~n := #in~n; 9104#L18 assume !(~n < 1); 9102#L20 assume !(~n == 1); 9086#L23 call #t~ret2 := fibo1(~n - 1);< 9097#fibo1ENTRY ~n := #in~n; 9095#L8 assume !(~n < 1); 9093#L10 assume !(~n == 1); 9090#L13 call #t~ret0 := fibo2(~n - 1);< 9091#fibo2ENTRY ~n := #in~n; 9096#L18 assume !(~n < 1); 9094#L20 assume !(~n == 1); 9087#L23 call #t~ret2 := fibo1(~n - 1);< 9097#fibo1ENTRY ~n := #in~n; 9098#L8 assume !(~n < 1); 9189#L10 assume ~n == 1;#res := 1; 9190#fibo1FINAL assume true; 9199#fibo1EXIT >#46#return; 9039#L23-1 call #t~ret3 := fibo1(~n - 2);< 9196#fibo1ENTRY ~n := #in~n; 9206#L8 assume ~n < 1;#res := 0; 9197#fibo1FINAL assume true; 9195#fibo1EXIT >#48#return; 9194#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9193#fibo2FINAL assume true; 9145#fibo2EXIT >#50#return; 9132#L13-1 [2018-11-10 11:21:24,970 INFO L795 eck$LassoCheckResult]: Loop: 9132#L13-1 call #t~ret1 := fibo2(~n - 2);< 9135#fibo2ENTRY ~n := #in~n; 9134#L18 assume !(~n < 1); 9130#L20 assume !(~n == 1); 9117#L23 call #t~ret2 := fibo1(~n - 1);< 9124#fibo1ENTRY ~n := #in~n; 9125#L8 assume !(~n < 1); 9116#L10 assume ~n == 1;#res := 1; 9118#fibo1FINAL assume true; 9241#fibo1EXIT >#46#return; 9160#L23-1 call #t~ret3 := fibo1(~n - 2);< 9164#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9231#L10 assume !(~n == 1); 9202#L13 call #t~ret0 := fibo2(~n - 1);< 9230#fibo2ENTRY ~n := #in~n; 9229#L18 assume !(~n < 1); 9211#L20 assume !(~n == 1); 9163#L23 call #t~ret2 := fibo1(~n - 1);< 9164#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9231#L10 assume ~n == 1;#res := 1; 9232#fibo1FINAL assume true; 9242#fibo1EXIT >#46#return; 9160#L23-1 call #t~ret3 := fibo1(~n - 2);< 9164#fibo1ENTRY ~n := #in~n; 9233#L8 assume ~n < 1;#res := 0; 9234#fibo1FINAL assume true; 9282#fibo1EXIT >#48#return; 9262#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9257#fibo2FINAL assume true; 9251#fibo2EXIT >#50#return; 9132#L13-1 [2018-11-10 11:21:24,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 1 times [2018-11-10 11:21:24,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1364976163, now seen corresponding path program 1 times [2018-11-10 11:21:24,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:24,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 11:21:25,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:25,023 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:21:25,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:25,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 11:21:25,087 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:21:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:21:25,088 INFO L87 Difference]: Start difference. First operand 591 states and 727 transitions. cyclomatic complexity: 145 Second operand 7 states. [2018-11-10 11:21:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:25,153 INFO L93 Difference]: Finished difference Result 617 states and 751 transitions. [2018-11-10 11:21:25,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:21:25,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 617 states and 751 transitions. [2018-11-10 11:21:25,158 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2018-11-10 11:21:25,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 617 states to 607 states and 737 transitions. [2018-11-10 11:21:25,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-10 11:21:25,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2018-11-10 11:21:25,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 607 states and 737 transitions. [2018-11-10 11:21:25,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:25,163 INFO L705 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 11:21:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states and 737 transitions. [2018-11-10 11:21:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-11-10 11:21:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-10 11:21:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 737 transitions. [2018-11-10 11:21:25,174 INFO L728 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 11:21:25,174 INFO L608 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 11:21:25,174 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:21:25,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 737 transitions. [2018-11-10 11:21:25,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2018-11-10 11:21:25,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:25,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:25,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:25,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:25,179 INFO L793 eck$LassoCheckResult]: Stem: 10285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 10226#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10227#fibo1ENTRY ~n := #in~n; 10391#L8 assume !(~n < 1); 10390#L10 assume !(~n == 1); 10387#L13 call #t~ret0 := fibo2(~n - 1);< 10389#fibo2ENTRY ~n := #in~n; 10388#L18 assume !(~n < 1); 10386#L20 assume !(~n == 1); 10276#L23 call #t~ret2 := fibo1(~n - 1);< 10380#fibo1ENTRY ~n := #in~n; 10378#L8 assume !(~n < 1); 10376#L10 assume !(~n == 1); 10235#L13 call #t~ret0 := fibo2(~n - 1);< 10374#fibo2ENTRY ~n := #in~n; 10379#L18 assume !(~n < 1); 10377#L20 assume !(~n == 1); 10278#L23 call #t~ret2 := fibo1(~n - 1);< 10380#fibo1ENTRY ~n := #in~n; 10381#L8 assume !(~n < 1); 10440#L10 assume ~n == 1;#res := 1; 10441#fibo1FINAL assume true; 10823#fibo1EXIT >#46#return; 10241#L23-1 call #t~ret3 := fibo1(~n - 2);< 10242#fibo1ENTRY ~n := #in~n; 10286#L8 assume ~n < 1;#res := 0; 10297#fibo1FINAL assume true; 10820#fibo1EXIT >#48#return; 10246#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10234#fibo2FINAL assume true; 10237#fibo2EXIT >#50#return; 10407#L13-1 [2018-11-10 11:21:25,180 INFO L795 eck$LassoCheckResult]: Loop: 10407#L13-1 call #t~ret1 := fibo2(~n - 2);< 10410#fibo2ENTRY ~n := #in~n; 10409#L18 assume !(~n < 1); 10408#L20 assume !(~n == 1); 10266#L23 call #t~ret2 := fibo1(~n - 1);< 10404#fibo1ENTRY ~n := #in~n; 10403#L8 assume !(~n < 1); 10400#L10 assume !(~n == 1); 10402#L13 call #t~ret0 := fibo2(~n - 1);< 10744#fibo2ENTRY ~n := #in~n; 10790#L18 assume !(~n < 1); 10788#L20 assume ~n == 1;#res := 1; 10789#fibo2FINAL assume true; 10742#fibo2EXIT >#50#return; 10265#L13-1 call #t~ret1 := fibo2(~n - 2);< 10267#fibo2ENTRY ~n := #in~n; 10290#L18 assume ~n < 1;#res := 0; 10300#fibo2FINAL assume true; 10294#fibo2EXIT >#52#return; 10295#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 10810#fibo1FINAL assume true; 10807#fibo1EXIT >#46#return; 10253#L23-1 call #t~ret3 := fibo1(~n - 2);< 10752#fibo1ENTRY ~n := #in~n; 10750#L8 assume !(~n < 1); 10749#L10 assume !(~n == 1); 10258#L13 call #t~ret0 := fibo2(~n - 1);< 10259#fibo2ENTRY ~n := #in~n; 10760#L18 assume !(~n < 1); 10758#L20 assume ~n == 1;#res := 1; 10759#fibo2FINAL assume true; 10795#fibo2EXIT >#50#return; 10407#L13-1 [2018-11-10 11:21:25,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 2 times [2018-11-10 11:21:25,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:25,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1807088251, now seen corresponding path program 1 times [2018-11-10 11:21:25,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:21:25,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:25,263 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:25,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:21:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:25,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 11:21:25,308 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:21:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:21:25,309 INFO L87 Difference]: Start difference. First operand 607 states and 737 transitions. cyclomatic complexity: 139 Second operand 10 states. [2018-11-10 11:21:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:25,443 INFO L93 Difference]: Finished difference Result 381 states and 479 transitions. [2018-11-10 11:21:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:21:25,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 479 transitions. [2018-11-10 11:21:25,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-10 11:21:25,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 277 states and 336 transitions. [2018-11-10 11:21:25,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2018-11-10 11:21:25,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2018-11-10 11:21:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 336 transitions. [2018-11-10 11:21:25,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:25,450 INFO L705 BuchiCegarLoop]: Abstraction has 277 states and 336 transitions. [2018-11-10 11:21:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 336 transitions. [2018-11-10 11:21:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2018-11-10 11:21:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 11:21:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 325 transitions. [2018-11-10 11:21:25,457 INFO L728 BuchiCegarLoop]: Abstraction has 271 states and 325 transitions. [2018-11-10 11:21:25,457 INFO L608 BuchiCegarLoop]: Abstraction has 271 states and 325 transitions. [2018-11-10 11:21:25,457 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:21:25,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 325 transitions. [2018-11-10 11:21:25,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-10 11:21:25,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:25,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:25,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:25,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:25,461 INFO L793 eck$LassoCheckResult]: Stem: 11375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 11345#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11346#fibo1ENTRY ~n := #in~n; 11453#L8 assume !(~n < 1); 11452#L10 assume !(~n == 1); 11448#L13 call #t~ret0 := fibo2(~n - 1);< 11451#fibo2ENTRY ~n := #in~n; 11450#L18 assume !(~n < 1); 11449#L20 assume !(~n == 1); 11432#L23 call #t~ret2 := fibo1(~n - 1);< 11446#fibo1ENTRY ~n := #in~n; 11443#L8 assume !(~n < 1); 11440#L10 assume !(~n == 1); 11436#L13 call #t~ret0 := fibo2(~n - 1);< 11437#fibo2ENTRY ~n := #in~n; 11445#L18 assume !(~n < 1); 11442#L20 assume ~n == 1;#res := 1; 11439#fibo2FINAL assume true; 11435#fibo2EXIT >#50#return; 11421#L13-1 call #t~ret1 := fibo2(~n - 2);< 11430#fibo2ENTRY ~n := #in~n; 11428#L18 assume !(~n < 1); 11426#L20 assume !(~n == 1); 11412#L23 call #t~ret2 := fibo1(~n - 1);< 11419#fibo1ENTRY ~n := #in~n; 11417#L8 assume !(~n < 1); 11414#L10 assume !(~n == 1); 11398#L13 call #t~ret0 := fibo2(~n - 1);< 11410#fibo2ENTRY ~n := #in~n; 11407#L18 assume !(~n < 1); 11402#L20 assume !(~n == 1); 11396#L23 call #t~ret2 := fibo1(~n - 1);< 11399#fibo1ENTRY ~n := #in~n; 11409#L8 assume !(~n < 1); 11406#L10 assume ~n == 1;#res := 1; 11401#fibo1FINAL assume true; 11395#fibo1EXIT >#46#return; 11397#L23-1 call #t~ret3 := fibo1(~n - 2);< 11461#fibo1ENTRY ~n := #in~n; 11463#L8 assume ~n < 1;#res := 0; 11462#fibo1FINAL assume true; 11460#fibo1EXIT >#48#return; 11459#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11458#fibo2FINAL assume true; 11457#fibo2EXIT >#50#return; 11387#L13-1 call #t~ret1 := fibo2(~n - 2);< 11431#fibo2ENTRY ~n := #in~n; 11429#L18 assume !(~n < 1); 11427#L20 assume !(~n == 1); 11413#L23 [2018-11-10 11:21:25,461 INFO L795 eck$LassoCheckResult]: Loop: 11413#L23 call #t~ret2 := fibo1(~n - 1);< 11420#fibo1ENTRY ~n := #in~n; 11418#L8 assume !(~n < 1); 11415#L10 assume !(~n == 1); 11333#L13 call #t~ret0 := fibo2(~n - 1);< 11411#fibo2ENTRY ~n := #in~n; 11408#L18 assume !(~n < 1); 11404#L20 assume ~n == 1;#res := 1; 11405#fibo2FINAL assume true; 11522#fibo2EXIT >#50#return; 11424#L13-1 call #t~ret1 := fibo2(~n - 2);< 11431#fibo2ENTRY ~n := #in~n; 11429#L18 assume !(~n < 1); 11427#L20 assume !(~n == 1); 11413#L23 [2018-11-10 11:21:25,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2079695015, now seen corresponding path program 1 times [2018-11-10 11:21:25,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:21:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:25,569 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:25,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 11:21:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-10 11:21:25,699 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:25,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1790571152, now seen corresponding path program 2 times [2018-11-10 11:21:25,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:25,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:25,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:25,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:21:25,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:21:25,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:21:25,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:25,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:25,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 11:21:25,779 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:21:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:21:25,780 INFO L87 Difference]: Start difference. First operand 271 states and 325 transitions. cyclomatic complexity: 59 Second operand 7 states. [2018-11-10 11:21:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:25,845 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2018-11-10 11:21:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:21:25,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 258 transitions. [2018-11-10 11:21:25,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:21:25,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 196 states and 234 transitions. [2018-11-10 11:21:25,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-11-10 11:21:25,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 11:21:25,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 234 transitions. [2018-11-10 11:21:25,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:25,849 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 234 transitions. [2018-11-10 11:21:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 234 transitions. [2018-11-10 11:21:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2018-11-10 11:21:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 11:21:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2018-11-10 11:21:25,855 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-10 11:21:25,855 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-10 11:21:25,855 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 11:21:25,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 211 transitions. [2018-11-10 11:21:25,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:21:25,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:25,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:25,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:25,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-10 11:21:25,858 INFO L793 eck$LassoCheckResult]: Stem: 12076#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12075#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 12038#L37 call main_#t~ret4 := fibo1(main_~x~0);< 12039#fibo1ENTRY ~n := #in~n; 12106#L8 assume !(~n < 1); 12043#L10 assume !(~n == 1); 12044#L13 call #t~ret0 := fibo2(~n - 1);< 12063#fibo2ENTRY ~n := #in~n; 12085#L18 assume !(~n < 1); 12090#L20 assume !(~n == 1); 12081#L23 call #t~ret2 := fibo1(~n - 1);< 12079#fibo1ENTRY ~n := #in~n; 12082#L8 assume !(~n < 1); 12088#L10 assume !(~n == 1); 12105#L13 call #t~ret0 := fibo2(~n - 1);< 12123#fibo2ENTRY ~n := #in~n; 12137#L18 assume !(~n < 1); 12136#L20 assume !(~n == 1); 12080#L23 call #t~ret2 := fibo1(~n - 1);< 12079#fibo1ENTRY ~n := #in~n; 12083#L8 assume !(~n < 1); 12147#L10 assume ~n == 1;#res := 1; 12145#fibo1FINAL assume true; 12144#fibo1EXIT >#46#return; 12142#L23-1 call #t~ret3 := fibo1(~n - 2);< 12143#fibo1ENTRY ~n := #in~n; 12148#L8 assume ~n < 1;#res := 0; 12146#fibo1FINAL assume true; 12141#fibo1EXIT >#48#return; 12140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12138#fibo2FINAL assume true; 12122#fibo2EXIT >#50#return; 12034#L13-1 [2018-11-10 11:21:25,858 INFO L795 eck$LassoCheckResult]: Loop: 12034#L13-1 call #t~ret1 := fibo2(~n - 2);< 12073#fibo2ENTRY ~n := #in~n; 12108#L18 assume !(~n < 1); 12107#L20 assume !(~n == 1); 12033#L23 call #t~ret2 := fibo1(~n - 1);< 12037#fibo1ENTRY ~n := #in~n; 12098#L8 assume !(~n < 1); 12094#L10 assume !(~n == 1); 12096#L13 call #t~ret0 := fibo2(~n - 1);< 12175#fibo2ENTRY ~n := #in~n; 12185#L18 assume !(~n < 1); 12184#L20 assume !(~n == 1); 12067#L23 call #t~ret2 := fibo1(~n - 1);< 12172#fibo1ENTRY ~n := #in~n; 12173#L8 assume !(~n < 1); 12186#L10 assume ~n == 1;#res := 1; 12183#fibo1FINAL assume true; 12182#fibo1EXIT >#46#return; 12077#L23-1 call #t~ret3 := fibo1(~n - 2);< 12046#fibo1ENTRY ~n := #in~n; 12078#L8 assume ~n < 1;#res := 0; 12087#fibo1FINAL assume true; 12180#fibo1EXIT >#48#return; 12179#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12177#fibo2FINAL assume true; 12174#fibo2EXIT >#50#return; 12170#L13-1 call #t~ret1 := fibo2(~n - 2);< 12171#fibo2ENTRY ~n := #in~n; 12203#L18 assume ~n < 1;#res := 0; 12202#fibo2FINAL assume true; 12169#fibo2EXIT >#52#return; 12167#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12165#fibo1FINAL assume true; 12160#fibo1EXIT >#46#return; 12113#L23-1 call #t~ret3 := fibo1(~n - 2);< 12127#fibo1ENTRY ~n := #in~n; 12124#L8 assume !(~n < 1); 12119#L10 assume !(~n == 1); 12110#L13 call #t~ret0 := fibo2(~n - 1);< 12116#fibo2ENTRY ~n := #in~n; 12153#L18 assume !(~n < 1); 12150#L20 assume !(~n == 1); 12115#L23 call #t~ret2 := fibo1(~n - 1);< 12127#fibo1ENTRY ~n := #in~n; 12124#L8 assume !(~n < 1); 12119#L10 assume ~n == 1;#res := 1; 12120#fibo1FINAL assume true; 12135#fibo1EXIT >#46#return; 12131#L23-1 call #t~ret3 := fibo1(~n - 2);< 12132#fibo1ENTRY ~n := #in~n; 12139#L8 assume ~n < 1;#res := 0; 12125#fibo1FINAL assume true; 12130#fibo1EXIT >#48#return; 12121#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12117#fibo2FINAL assume true; 12109#fibo2EXIT >#50#return; 12034#L13-1 [2018-11-10 11:21:25,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 3 times [2018-11-10 11:21:25,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:25,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:25,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1747231413, now seen corresponding path program 1 times [2018-11-10 11:21:25,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:25,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:25,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 11:21:25,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:25,967 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:25,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:25,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 11:21:26,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-10 11:21:26,031 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:21:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:21:26,032 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. cyclomatic complexity: 36 Second operand 11 states. [2018-11-10 11:21:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:26,100 INFO L93 Difference]: Finished difference Result 184 states and 213 transitions. [2018-11-10 11:21:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:21:26,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 213 transitions. [2018-11-10 11:21:26,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:21:26,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 178 states and 207 transitions. [2018-11-10 11:21:26,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-10 11:21:26,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-10 11:21:26,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 207 transitions. [2018-11-10 11:21:26,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:26,104 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 11:21:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 207 transitions. [2018-11-10 11:21:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-11-10 11:21:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 11:21:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2018-11-10 11:21:26,109 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 11:21:26,109 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 11:21:26,109 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 11:21:26,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 207 transitions. [2018-11-10 11:21:26,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:21:26,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:26,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:26,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:26,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-10 11:21:26,112 INFO L793 eck$LassoCheckResult]: Stem: 12631#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 12604#L37 call main_#t~ret4 := fibo1(main_~x~0);< 12605#fibo1ENTRY ~n := #in~n; 12687#L8 assume !(~n < 1); 12686#L10 assume !(~n == 1); 12585#L13 call #t~ret0 := fibo2(~n - 1);< 12613#fibo2ENTRY ~n := #in~n; 12637#L18 assume !(~n < 1); 12638#L20 assume !(~n == 1); 12584#L23 call #t~ret2 := fibo1(~n - 1);< 12586#fibo1ENTRY ~n := #in~n; 12629#L8 assume !(~n < 1); 12595#L10 assume !(~n == 1); 12597#L13 call #t~ret0 := fibo2(~n - 1);< 12633#fibo2ENTRY ~n := #in~n; 12634#L18 assume !(~n < 1); 12636#L20 assume !(~n == 1); 12596#L23 call #t~ret2 := fibo1(~n - 1);< 12586#fibo1ENTRY ~n := #in~n; 12630#L8 assume !(~n < 1); 12704#L10 assume ~n == 1;#res := 1; 12700#fibo1FINAL assume true; 12697#fibo1EXIT >#46#return; 12689#L23-1 call #t~ret3 := fibo1(~n - 2);< 12690#fibo1ENTRY ~n := #in~n; 12693#L8 assume ~n < 1;#res := 0; 12692#fibo1FINAL assume true; 12688#fibo1EXIT >#48#return; 12685#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12684#fibo2FINAL assume true; 12669#fibo2EXIT >#50#return; 12652#L13-1 [2018-11-10 11:21:26,112 INFO L795 eck$LassoCheckResult]: Loop: 12652#L13-1 call #t~ret1 := fibo2(~n - 2);< 12624#fibo2ENTRY ~n := #in~n; 12655#L18 assume !(~n < 1); 12654#L20 assume !(~n == 1); 12623#L23 call #t~ret2 := fibo1(~n - 1);< 12651#fibo1ENTRY ~n := #in~n; 12650#L8 assume !(~n < 1); 12645#L10 assume !(~n == 1); 12599#L13 call #t~ret0 := fibo2(~n - 1);< 12715#fibo2ENTRY ~n := #in~n; 12726#L18 assume !(~n < 1); 12725#L20 assume !(~n == 1); 12615#L23 call #t~ret2 := fibo1(~n - 1);< 12601#fibo1ENTRY ~n := #in~n; 12731#L8 assume !(~n < 1); 12730#L10 assume ~n == 1;#res := 1; 12727#fibo1FINAL assume true; 12724#fibo1EXIT >#46#return; 12721#L23-1 call #t~ret3 := fibo1(~n - 2);< 12723#fibo1ENTRY ~n := #in~n; 12733#L8 assume ~n < 1;#res := 0; 12732#fibo1FINAL assume true; 12719#fibo1EXIT >#48#return; 12717#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12716#fibo2FINAL assume true; 12714#fibo2EXIT >#50#return; 12711#L13-1 call #t~ret1 := fibo2(~n - 2);< 12712#fibo2ENTRY ~n := #in~n; 12729#L18 assume !(~n < 1); 12728#L20 assume ~n == 1;#res := 1; 12718#fibo2FINAL assume true; 12710#fibo2EXIT >#52#return; 12709#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12707#fibo1FINAL assume true; 12694#fibo1EXIT >#46#return; 12662#L23-1 call #t~ret3 := fibo1(~n - 2);< 12675#fibo1ENTRY ~n := #in~n; 12670#L8 assume !(~n < 1); 12666#L10 assume !(~n == 1); 12657#L13 call #t~ret0 := fibo2(~n - 1);< 12663#fibo2ENTRY ~n := #in~n; 12680#L18 assume !(~n < 1); 12678#L20 assume !(~n == 1); 12660#L23 call #t~ret2 := fibo1(~n - 1);< 12675#fibo1ENTRY ~n := #in~n; 12670#L8 assume !(~n < 1); 12666#L10 assume ~n == 1;#res := 1; 12667#fibo1FINAL assume true; 12676#fibo1EXIT >#46#return; 12673#L23-1 call #t~ret3 := fibo1(~n - 2);< 12674#fibo1ENTRY ~n := #in~n; 12691#L8 assume ~n < 1;#res := 0; 12671#fibo1FINAL assume true; 12672#fibo1EXIT >#48#return; 12668#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12664#fibo2FINAL assume true; 12656#fibo2EXIT >#50#return; 12652#L13-1 [2018-11-10 11:21:26,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 4 times [2018-11-10 11:21:26,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:26,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1582059376, now seen corresponding path program 1 times [2018-11-10 11:21:26,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:26,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 11:21:26,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:26,255 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 11:21:26,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:26,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 43 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 11:21:26,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:26,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-11-10 11:21:26,385 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:21:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:21:26,386 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. cyclomatic complexity: 32 Second operand 17 states. [2018-11-10 11:21:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:26,750 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2018-11-10 11:21:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:21:26,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 207 transitions. [2018-11-10 11:21:26,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 11:21:26,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 137 states and 146 transitions. [2018-11-10 11:21:26,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2018-11-10 11:21:26,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2018-11-10 11:21:26,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 146 transitions. [2018-11-10 11:21:26,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:26,754 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 146 transitions. [2018-11-10 11:21:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 146 transitions. [2018-11-10 11:21:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2018-11-10 11:21:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 11:21:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-11-10 11:21:26,757 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-11-10 11:21:26,758 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-11-10 11:21:26,758 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 11:21:26,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 136 transitions. [2018-11-10 11:21:26,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 11:21:26,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:26,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:26,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:26,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:26,760 INFO L793 eck$LassoCheckResult]: Stem: 13202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13175#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13177#fibo1ENTRY ~n := #in~n; 13231#L8 assume !(~n < 1); 13174#L10 assume !(~n == 1); 13176#L13 call #t~ret0 := fibo2(~n - 1);< 13253#fibo2ENTRY ~n := #in~n; 13252#L18 assume !(~n < 1); 13251#L20 assume !(~n == 1); 13186#L23 call #t~ret2 := fibo1(~n - 1);< 13159#fibo1ENTRY ~n := #in~n; 13200#L8 assume !(~n < 1); 13211#L10 assume !(~n == 1); 13158#L13 call #t~ret0 := fibo2(~n - 1);< 13187#fibo2ENTRY ~n := #in~n; 13206#L18 assume !(~n < 1); 13213#L20 assume !(~n == 1); 13157#L23 call #t~ret2 := fibo1(~n - 1);< 13159#fibo1ENTRY ~n := #in~n; 13201#L8 assume !(~n < 1); 13274#L10 assume ~n == 1;#res := 1; 13273#fibo1FINAL assume true; 13272#fibo1EXIT >#46#return; 13198#L23-1 call #t~ret3 := fibo1(~n - 2);< 13197#fibo1ENTRY ~n := #in~n; 13199#L8 assume ~n < 1;#res := 0; 13277#fibo1FINAL assume true; 13275#fibo1EXIT >#48#return; 13234#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13233#fibo2FINAL assume true; 13232#fibo2EXIT >#50#return; 13161#L13-1 call #t~ret1 := fibo2(~n - 2);< 13194#fibo2ENTRY ~n := #in~n; 13230#L18 assume !(~n < 1); 13229#L20 assume !(~n == 1); 13184#L23 call #t~ret2 := fibo1(~n - 1);< 13228#fibo1ENTRY ~n := #in~n; 13221#L8 assume !(~n < 1); 13218#L10 assume !(~n == 1); 13173#L13 [2018-11-10 11:21:26,760 INFO L795 eck$LassoCheckResult]: Loop: 13173#L13 call #t~ret0 := fibo2(~n - 1);< 13185#fibo2ENTRY ~n := #in~n; 13214#L18 assume !(~n < 1); 13215#L20 assume !(~n == 1); 13191#L23 call #t~ret2 := fibo1(~n - 1);< 13250#fibo1ENTRY ~n := #in~n; 13248#L8 assume !(~n < 1); 13245#L10 assume !(~n == 1); 13208#L13 call #t~ret0 := fibo2(~n - 1);< 13242#fibo2ENTRY ~n := #in~n; 13270#L18 assume !(~n < 1); 13269#L20 assume !(~n == 1); 13192#L23 call #t~ret2 := fibo1(~n - 1);< 13250#fibo1ENTRY ~n := #in~n; 13248#L8 assume !(~n < 1); 13245#L10 assume ~n == 1;#res := 1; 13246#fibo1FINAL assume true; 13267#fibo1EXIT >#46#return; 13265#L23-1 call #t~ret3 := fibo1(~n - 2);< 13266#fibo1ENTRY ~n := #in~n; 13268#L8 assume ~n < 1;#res := 0; 13249#fibo1FINAL assume true; 13264#fibo1EXIT >#48#return; 13263#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13262#fibo2FINAL assume true; 13207#fibo2EXIT >#50#return; 13155#L13-1 call #t~ret1 := fibo2(~n - 2);< 13193#fibo2ENTRY ~n := #in~n; 13278#L18 assume !(~n < 1); 13276#L20 assume !(~n == 1); 13154#L23 call #t~ret2 := fibo1(~n - 1);< 13156#fibo1ENTRY ~n := #in~n; 13279#L8 assume !(~n < 1); 13172#L10 assume !(~n == 1); 13173#L13 [2018-11-10 11:21:26,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2127928097, now seen corresponding path program 1 times [2018-11-10 11:21:26,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:26,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:21:26,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:26,877 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:26,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:21:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:27,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-11-10 11:21:27,012 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:21:27,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1849950214, now seen corresponding path program 2 times [2018-11-10 11:21:27,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:21:27,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:21:27,085 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:21:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:21:27,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:21:27,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:21:27,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:21:27,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:21:27,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 11:21:27,128 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:21:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:21:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:21:27,128 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-10 11:21:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:21:27,258 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-11-10 11:21:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:21:27,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 140 transitions. [2018-11-10 11:21:27,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 11:21:27,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 82 states and 84 transitions. [2018-11-10 11:21:27,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 11:21:27,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-10 11:21:27,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2018-11-10 11:21:27,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:21:27,262 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-10 11:21:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2018-11-10 11:21:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-10 11:21:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 11:21:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-10 11:21:27,264 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 11:21:27,264 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 11:21:27,264 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 11:21:27,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 72 transitions. [2018-11-10 11:21:27,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 11:21:27,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:21:27,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:21:27,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:27,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:21:27,265 INFO L793 eck$LassoCheckResult]: Stem: 13703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13699#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13687#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13688#fibo1ENTRY ~n := #in~n; 13707#L8 assume !(~n < 1); 13686#L10 assume !(~n == 1); 13679#L13 call #t~ret0 := fibo2(~n - 1);< 13705#fibo2ENTRY ~n := #in~n; 13706#L18 assume !(~n < 1); 13709#L20 assume !(~n == 1); 13678#L23 call #t~ret2 := fibo1(~n - 1);< 13680#fibo1ENTRY ~n := #in~n; 13701#L8 assume !(~n < 1); 13734#L10 assume !(~n == 1); 13693#L13 call #t~ret0 := fibo2(~n - 1);< 13694#fibo2ENTRY ~n := #in~n; 13710#L18 assume !(~n < 1); 13711#L20 assume !(~n == 1); 13691#L23 call #t~ret2 := fibo1(~n - 1);< 13680#fibo1ENTRY ~n := #in~n; 13702#L8 assume !(~n < 1); 13740#L10 assume ~n == 1;#res := 1; 13695#fibo1FINAL assume true; 13696#fibo1EXIT >#46#return; 13713#L23-1 call #t~ret3 := fibo1(~n - 2);< 13719#fibo1ENTRY ~n := #in~n; 13716#L8 assume ~n < 1;#res := 0; 13715#fibo1FINAL assume true; 13712#fibo1EXIT >#48#return; 13714#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13738#fibo2FINAL assume true; 13737#fibo2EXIT >#50#return; 13722#L13-1 call #t~ret1 := fibo2(~n - 2);< 13736#fibo2ENTRY ~n := #in~n; 13743#L18 assume !(~n < 1); 13742#L20 assume ~n == 1;#res := 1; 13741#fibo2FINAL assume true; 13735#fibo2EXIT >#52#return; 13697#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 13698#fibo1FINAL assume true; 13690#fibo1EXIT >#46#return; 13683#L23-1 call #t~ret3 := fibo1(~n - 2);< 13684#fibo1ENTRY ~n := #in~n; 13730#L8 assume !(~n < 1); 13729#L10 assume !(~n == 1); 13727#L13 call #t~ret0 := fibo2(~n - 1);< 13728#fibo2ENTRY ~n := #in~n; 13733#L18 assume !(~n < 1); 13732#L20 assume ~n == 1;#res := 1; 13731#fibo2FINAL assume true; 13726#fibo2EXIT >#50#return; 13721#L13-1 call #t~ret1 := fibo2(~n - 2);< 13723#fibo2ENTRY ~n := #in~n; 13725#L18 assume ~n < 1;#res := 0; 13724#fibo2FINAL assume true; 13720#fibo2EXIT >#52#return; 13717#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 13718#fibo1FINAL assume true; 13739#fibo1EXIT >#48#return; 13689#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13681#fibo2FINAL assume true; 13682#fibo2EXIT >#50#return; 13677#L13-1 call #t~ret1 := fibo2(~n - 2);< 13692#fibo2ENTRY [2018-11-10 11:21:27,266 INFO L795 eck$LassoCheckResult]: Loop: 13692#fibo2ENTRY ~n := #in~n; 13704#L18 assume !(~n < 1); 13708#L20 assume !(~n == 1); 13674#L23 call #t~ret2 := fibo1(~n - 1);< 13676#fibo1ENTRY ~n := #in~n; 13700#L8 assume !(~n < 1); 13685#L10 assume !(~n == 1); 13675#L13 call #t~ret0 := fibo2(~n - 1);< 13692#fibo2ENTRY [2018-11-10 11:21:27,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash 730842524, now seen corresponding path program 1 times [2018-11-10 11:21:27,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2018-11-10 11:21:27,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:27,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:27,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:21:27,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1716080253, now seen corresponding path program 2 times [2018-11-10 11:21:27,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:21:27,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:21:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:21:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:21:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:21:27,365 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:27,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:27,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:27,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:27,366 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:21:27,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:27,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:27,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration12_Loop [2018-11-10 11:21:27,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:27,366 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:27,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,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-10 11:21:27,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,446 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:27,447 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,455 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,456 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,479 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,479 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,513 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,514 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,537 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,537 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,565 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,565 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,589 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,589 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,612 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,612 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,634 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:21:27,634 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:21:27,654 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e7519b2-4319-4dc2-84ac-d6f3689921dc/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:21:27,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:21:27,698 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:21:27,699 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:21:27,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:21:27,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:21:27,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:21:27,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:21:27,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:21:27,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:21:27,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:21:27,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration12_Loop [2018-11-10 11:21:27,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:21:27,700 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:21:27,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:21:27,750 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:21:27,750 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:21:27,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:21:27,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:21:27,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:21:27,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:21:27,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:21:27,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:21:27,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:21:27,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:21:27,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:21:27,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:21:27,773 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:21:27,773 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:21:27,773 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:21:27,773 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:21:27,774 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:21:27,774 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-10 11:21:27,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:21:27,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:27,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:27,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:27,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 11:21:27,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 11:21:27,954 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 78 states and 79 transitions. Complement of second has 7 states. [2018-11-10 11:21:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:21:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 11:21:27,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 11:21:27,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:27,956 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:21:27,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:28,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:28,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:28,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 11:21:28,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 11:21:28,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 78 states and 79 transitions. Complement of second has 7 states. [2018-11-10 11:21:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 11:21:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:21:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 11:21:28,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 11:21:28,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:28,106 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:21:28,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:21:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:28,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:21:28,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:21:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:21:28,253 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 11:21:28,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 11:21:28,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 91 states and 95 transitions. Complement of second has 15 states. [2018-11-10 11:21:28,361 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-10 11:21:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:21:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-10 11:21:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 11:21:28,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 71 letters. Loop has 8 letters. [2018-11-10 11:21:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 63 letters. Loop has 16 letters. [2018-11-10 11:21:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:21:28,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-11-10 11:21:28,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:21:28,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-11-10 11:21:28,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:21:28,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:21:28,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:21:28,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:21:28,365 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:21:28,365 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:21:28,365 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:21:28,365 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 11:21:28,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:21:28,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:21:28,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:21:28,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:21:28 BoogieIcfgContainer [2018-11-10 11:21:28,370 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:21:28,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:21:28,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:21:28,370 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:21:28,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:21:17" (3/4) ... [2018-11-10 11:21:28,374 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:21:28,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:21:28,374 INFO L168 Benchmark]: Toolchain (without parser) took 11204.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.1 MB). Free memory was 959.8 MB in the beginning and 1.2 GB in the end (delta: -241.1 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:21:28,375 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:21:28,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:21:28,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.82 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:21:28,376 INFO L168 Benchmark]: Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:21:28,376 INFO L168 Benchmark]: RCFGBuilder took 207.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:21:28,377 INFO L168 Benchmark]: BuchiAutomizer took 10761.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -30.9 MB). Peak memory consumption was 154.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:21:28,377 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:21:28,382 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.82 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 207.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10761.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -30.9 MB). Peak memory consumption was 154.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 14 terminating modules (10 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 7 locations. 10 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 13 iterations. TraceHistogramMax:8. Analysis of lassos took 6.3s. Construction of modules took 1.2s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 270 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 607 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 400 SDtfs, 731 SDslu, 975 SDs, 0 SdLazy, 1752 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT2 conc0 concLT0 SILN0 SILU0 SILI4 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...