./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:11:26,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:11:26,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:11:26,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:11:26,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:11:26,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:11:26,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:11:26,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:11:26,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:11:26,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:11:26,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:11:26,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:11:26,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:11:26,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:11:26,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:11:26,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:11:26,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:11:26,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:11:26,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:11:26,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:11:26,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:11:26,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:11:26,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:11:26,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:11:26,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:11:26,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:11:26,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:11:26,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:11:26,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:11:26,075 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:11:26,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:11:26,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:11:26,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:11:26,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:11:26,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:11:26,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:11:26,077 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:11:26,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:11:26,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:11:26,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:11:26,089 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:11:26,089 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:11:26,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:11:26,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:11:26,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:11:26,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:11:26,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:11:26,093 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:11:26,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:11:26,093 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:11:26,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:11:26,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:11:26,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:11:26,094 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:11:26,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:11:26,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:11:26,094 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:11:26,095 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:11:26,095 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2018-11-10 04:11:26,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:11:26,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:11:26,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:11:26,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:11:26,135 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:11:26,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2018-11-10 04:11:26,188 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/data/7d1fc40e1/6cc67e0b26c942e9b429dd1b1b9875f4/FLAGd6078f550 [2018-11-10 04:11:26,524 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:11:26,525 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2018-11-10 04:11:26,529 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/data/7d1fc40e1/6cc67e0b26c942e9b429dd1b1b9875f4/FLAGd6078f550 [2018-11-10 04:11:26,540 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/data/7d1fc40e1/6cc67e0b26c942e9b429dd1b1b9875f4 [2018-11-10 04:11:26,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:11:26,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:11:26,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:11:26,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:11:26,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:11:26,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26, skipping insertion in model container [2018-11-10 04:11:26,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:11:26,570 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:11:26,684 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:11:26,687 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:11:26,700 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:11:26,711 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:11:26,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26 WrapperNode [2018-11-10 04:11:26,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:11:26,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:11:26,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:11:26,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:11:26,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:11:26,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:11:26,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:11:26,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:11:26,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... [2018-11-10 04:11:26,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:11:26,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:11:26,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:11:26,747 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:11:26,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:11:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:11:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 04:11:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 04:11:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 04:11:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 04:11:26,982 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:11:26,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:11:26 BoogieIcfgContainer [2018-11-10 04:11:26,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:11:26,983 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:11:26,984 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:11:26,987 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:11:26,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:11:26,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:11:26" (1/3) ... [2018-11-10 04:11:26,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2efad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:11:26, skipping insertion in model container [2018-11-10 04:11:26,989 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:11:26,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:11:26" (2/3) ... [2018-11-10 04:11:26,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2efad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:11:26, skipping insertion in model container [2018-11-10 04:11:26,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:11:26,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:11:26" (3/3) ... [2018-11-10 04:11:26,992 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_true-unreach-call_true-termination.c [2018-11-10 04:11:27,043 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:11:27,044 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:11:27,044 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:11:27,044 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:11:27,044 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:11:27,044 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:11:27,044 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:11:27,044 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:11:27,044 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:11:27,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 04:11:27,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:27,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:27,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:27,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 04:11:27,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:27,094 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:11:27,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 04:11:27,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:27,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:27,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:27,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 04:11:27,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:27,101 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 04:11:27,102 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 04:11:27,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2018-11-10 04:11:27,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:27,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2018-11-10 04:11:27,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:27,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2018-11-10 04:11:27,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:27,357 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:27,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:27,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:27,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:27,359 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:11:27,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:27,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:27,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:27,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 04:11:27,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:27,360 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11: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 04:11:27,392 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 04:11:27,396 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 04:11:27,399 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 04:11:27,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:27,404 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 04:11:27,406 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 04:11:27,409 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 04:11:27,411 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 04:11:27,415 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 04:11:27,501 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:27,501 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,526 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,526 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,548 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,548 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,571 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,571 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,590 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,590 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,610 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,610 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,629 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,630 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,651 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,651 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,672 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,673 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,702 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:27,702 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:27,718 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:27,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:11:27,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:27,791 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:11:27,792 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:27,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:27,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:27,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:27,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:11:27,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:27,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:27,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:27,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 04:11:27,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:27,793 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:27,794 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 04:11:27,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:27,797 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 04:11:27,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:27,800 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 04:11:27,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:27,805 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 04:11:27,807 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 04:11:27,812 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 04:11:27,818 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 04:11:27,964 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:27,970 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:11:27,972 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 04:11:27,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:27,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:27,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:27,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:27,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:27,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:27,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:27,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:27,981 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 04:11:27,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:27,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:27,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:27,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:27,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:27,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:27,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:27,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:27,985 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 04:11:27,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:27,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:27,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:27,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:27,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:27,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:27,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:27,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:27,991 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 04:11:27,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:27,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:27,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:27,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:27,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:27,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:27,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:27,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:27,996 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 04:11:27,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:27,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:27,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:27,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:27,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:27,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:27,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:28,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:28,007 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 04:11:28,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:28,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:28,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:28,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:28,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:28,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:28,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:28,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:28,011 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 04:11:28,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:28,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:28,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:28,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:28,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:28,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:28,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:28,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:28,015 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 04:11:28,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:28,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:28,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:28,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:28,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:28,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:28,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:28,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:28,019 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 04:11:28,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:28,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:28,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:28,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:28,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:28,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:28,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:28,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:11:28,035 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:11:28,035 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:11:28,037 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:11:28,037 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:11:28,037 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:11:28,038 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 04:11:28,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:11:28,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:28,245 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 04:11:28,257 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 04:11:28,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 6 states. [2018-11-10 04:11:28,406 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 04:11:28,406 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 04:11:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:11:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-10 04:11:28,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 04:11:28,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:28,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 04:11:28,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:28,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-10 04:11:28,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:28,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2018-11-10 04:11:28,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:28,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2018-11-10 04:11:28,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 04:11:28,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 04:11:28,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2018-11-10 04:11:28,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:28,427 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-10 04:11:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2018-11-10 04:11:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-10 04:11:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 04:11:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 04:11:28,455 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 04:11:28,455 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 04:11:28,455 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:11:28,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2018-11-10 04:11:28,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:28,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:28,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:28,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:28,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:28,458 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 04:11:28,458 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 04:11:28,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2018-11-10 04:11:28,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,522 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 04:11:28,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:11:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:11:28,525 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:28,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2018-11-10 04:11:28,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,570 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 04:11:28,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:11:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:11:28,570 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:11:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:11:28,573 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-10 04:11:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:28,643 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-10 04:11:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:11:28,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-10 04:11:28,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:28,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2018-11-10 04:11:28,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 04:11:28,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 04:11:28,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2018-11-10 04:11:28,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:28,650 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-10 04:11:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2018-11-10 04:11:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-10 04:11:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:11:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-11-10 04:11:28,657 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 04:11:28,657 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 04:11:28,657 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:11:28,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2018-11-10 04:11:28,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:11:28,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:28,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:28,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:28,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:28,661 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 04:11:28,661 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 04:11:28,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2018-11-10 04:11:28,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:28,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,722 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 04:11:28,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:28,722 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:28,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:28,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:28,747 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 04:11:28,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:28,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 04:11:28,765 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:28,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2018-11-10 04:11:28,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:28,878 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:28,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:28,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:28,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:28,879 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:11:28,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:28,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:28,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:28,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 04:11:28,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:28,879 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:28,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:28,881 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 04:11:28,882 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 04:11:28,886 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 04:11:28,888 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 04:11:28,890 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 04:11:28,891 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 04:11:28,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:28,893 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 04:11:28,922 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:28,922 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:28,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:28,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:28,929 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:28,929 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:28,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:28,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:28,949 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:28,949 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:28,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:28,969 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:28,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:11:28,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:29,864 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:11:29,866 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:29,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:29,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:29,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:29,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:11:29,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:29,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:29,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:29,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 04:11:29,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:29,867 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:29,868 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 04:11:29,870 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 04:11:29,871 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 04:11:29,877 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 04:11:29,878 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 04:11:29,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:29,882 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 04:11:29,884 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 04:11:29,936 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:29,936 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:11:29,937 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 04:11:29,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:29,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:29,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:29,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:29,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:29,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:29,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:29,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:29,943 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 04:11:29,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:29,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:29,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:29,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:29,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:29,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:29,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:29,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:29,945 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 04:11:29,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:29,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:29,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:29,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:29,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:29,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:29,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:29,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:11:29,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:11:29,955 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:11:29,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:11:29,955 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:11:29,956 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:11:29,956 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-10 04:11:29,956 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:11:29,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:29,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:30,064 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 04:11:30,065 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 04:11:30,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-10 04:11:30,270 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 04:11:30,271 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 04:11:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 04:11:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-10 04:11:30,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-10 04:11:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:30,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 30 letters. Loop has 14 letters. [2018-11-10 04:11:30,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:30,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 28 letters. [2018-11-10 04:11:30,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:30,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. [2018-11-10 04:11:30,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:11:30,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2018-11-10 04:11:30,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 04:11:30,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 04:11:30,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2018-11-10 04:11:30,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:30,286 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2018-11-10 04:11:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2018-11-10 04:11:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-10 04:11:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 04:11:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2018-11-10 04:11:30,301 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2018-11-10 04:11:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:11:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:11:30,302 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand 9 states. [2018-11-10 04:11:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:30,391 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2018-11-10 04:11:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:11:30,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 244 transitions. [2018-11-10 04:11:30,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:11:30,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 240 transitions. [2018-11-10 04:11:30,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-10 04:11:30,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-10 04:11:30,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 240 transitions. [2018-11-10 04:11:30,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:30,400 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 240 transitions. [2018-11-10 04:11:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 240 transitions. [2018-11-10 04:11:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-11-10 04:11:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 04:11:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2018-11-10 04:11:30,415 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 04:11:30,415 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 04:11:30,415 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:11:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 225 transitions. [2018-11-10 04:11:30,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:11:30,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:30,422 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 04:11:30,422 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 04:11:30,423 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~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 04:11:30,423 INFO L795 eck$LassoCheckResult]: Loop: 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(~n == 1); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(~n == 1); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 04:11:30,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 376035563, now seen corresponding path program 1 times [2018-11-10 04:11:30,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,481 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 04:11:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:30,481 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:30,617 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 04:11:30,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:30,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2018-11-10 04:11:30,634 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:30,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash 36254641, now seen corresponding path program 1 times [2018-11-10 04:11:30,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:30,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,674 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 04:11:30,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:30,674 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:30,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:30,701 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 04:11:30,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:11:30,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 04:11:30,720 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:11:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:11:30,721 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-10 04:11:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:30,760 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2018-11-10 04:11:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:11:30,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 236 transitions. [2018-11-10 04:11:30,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:11:30,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 172 states and 222 transitions. [2018-11-10 04:11:30,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 04:11:30,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 04:11:30,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 222 transitions. [2018-11-10 04:11:30,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:30,769 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 222 transitions. [2018-11-10 04:11:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 222 transitions. [2018-11-10 04:11:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2018-11-10 04:11:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 04:11:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2018-11-10 04:11:30,781 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 04:11:30,781 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 04:11:30,781 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:11:30,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 206 transitions. [2018-11-10 04:11:30,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 04:11:30,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:30,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:30,787 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 04:11:30,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:30,788 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~ret0;havoc #t~ret1; 2023#fibo1FINAL assume true; 2012#fibo1EXIT >#48#return; 2008#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2004#fibo2FINAL assume true; 1999#fibo2EXIT >#52#return; 1998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 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~ret0;havoc #t~ret1; 2023#fibo1FINAL assume true; 2012#fibo1EXIT >#48#return; 2008#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2004#fibo2FINAL assume true; 1999#fibo2EXIT >#50#return; 1936#L13-1 [2018-11-10 04:11:30,788 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 04:11:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 821073247, now seen corresponding path program 2 times [2018-11-10 04:11:30,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:30,948 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 04:11:30,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:30,948 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:30,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:11:30,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:11:30,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:11:30,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:31,015 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 04:11:31,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:31,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-10 04:11:31,032 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:31,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2018-11-10 04:11:31,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:31,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:31,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:31,132 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:31,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:31,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:31,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:31,133 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:11:31,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:31,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:31,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:31,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 04:11:31,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:31,133 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:31,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 04:11:31,138 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 04:11:31,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:31,141 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 04:11:31,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:31,144 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 04:11:31,145 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 04:11:31,151 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 04:11:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:31,185 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:31,185 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,214 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,214 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,219 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,220 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,240 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,241 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,261 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,281 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,282 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:31,300 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:31,300 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:31,317 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:31,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:11:31,337 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:32,020 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:11:32,022 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:32,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:32,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:32,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:32,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:11:32,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:32,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:32,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:32,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 04:11:32,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:32,022 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:32,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:32,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:32,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:32,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:32,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:11:32,030 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 04:11:32,030 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 04:11:32,041 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 04:11:32,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 04:11:32,070 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:32,070 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:11:32,070 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 04:11:32,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,073 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 04:11:32,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,074 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 04:11:32,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,081 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 04:11:32,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,083 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 04:11:32,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,085 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 04:11:32,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:32,087 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 04:11:32,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:32,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:32,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:32,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:32,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:32,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:32,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:32,090 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:11:32,093 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:11:32,093 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:11:32,093 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:11:32,093 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:11:32,093 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:11:32,094 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-10 04:11:32,094 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:11:32,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:32,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:32,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:32,326 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 04:11:32,327 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 04:11:32,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 04:11:32,605 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 04:11:32,608 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 04:11:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 04:11:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-11-10 04:11:32,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 04:11:32,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:32,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:11:32,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:32,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:32,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:32,811 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 04:11:32,811 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 04:11:32,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 04:11:32,998 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 04:11:32,999 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 04:11:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 04:11:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-10 04:11:33,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 04:11:33,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:33,001 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:11:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:33,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:33,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:33,163 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 04:11:33,164 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 04:11:33,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-10 04:11:33,387 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 04:11:33,388 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 04:11:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 04:11:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-11-10 04:11:33,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-10 04:11:33,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:33,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 97 letters. Loop has 14 letters. [2018-11-10 04:11:33,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:33,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 28 letters. [2018-11-10 04:11:33,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:33,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1661 states and 2157 transitions. [2018-11-10 04:11:33,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-10 04:11:33,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1661 states to 1189 states and 1644 transitions. [2018-11-10 04:11:33,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-10 04:11:33,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-10 04:11:33,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1189 states and 1644 transitions. [2018-11-10 04:11:33,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:33,430 INFO L705 BuchiCegarLoop]: Abstraction has 1189 states and 1644 transitions. [2018-11-10 04:11:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states and 1644 transitions. [2018-11-10 04:11:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1042. [2018-11-10 04:11:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-11-10 04:11:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1431 transitions. [2018-11-10 04:11:33,473 INFO L728 BuchiCegarLoop]: Abstraction has 1042 states and 1431 transitions. [2018-11-10 04:11:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:11:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:11:33,473 INFO L87 Difference]: Start difference. First operand 1042 states and 1431 transitions. Second operand 17 states. [2018-11-10 04:11:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:33,813 INFO L93 Difference]: Finished difference Result 1249 states and 1764 transitions. [2018-11-10 04:11:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 04:11:33,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1249 states and 1764 transitions. [2018-11-10 04:11:33,827 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2018-11-10 04:11:33,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1249 states to 609 states and 745 transitions. [2018-11-10 04:11:33,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-10 04:11:33,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2018-11-10 04:11:33,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 609 states and 745 transitions. [2018-11-10 04:11:33,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:33,834 INFO L705 BuchiCegarLoop]: Abstraction has 609 states and 745 transitions. [2018-11-10 04:11:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 745 transitions. [2018-11-10 04:11:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 591. [2018-11-10 04:11:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-11-10 04:11:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 727 transitions. [2018-11-10 04:11:33,851 INFO L728 BuchiCegarLoop]: Abstraction has 591 states and 727 transitions. [2018-11-10 04:11:33,851 INFO L608 BuchiCegarLoop]: Abstraction has 591 states and 727 transitions. [2018-11-10 04:11:33,851 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:11:33,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 591 states and 727 transitions. [2018-11-10 04:11:33,855 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-10 04:11:33,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:33,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:33,856 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 04:11:33,856 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 04:11:33,856 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~ret3;havoc #t~ret2; 9193#fibo2FINAL assume true; 9145#fibo2EXIT >#50#return; 9132#L13-1 [2018-11-10 04:11:33,857 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~ret3;havoc #t~ret2; 9257#fibo2FINAL assume true; 9251#fibo2EXIT >#50#return; 9132#L13-1 [2018-11-10 04:11:33,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 1 times [2018-11-10 04:11:33,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:33,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1364976163, now seen corresponding path program 1 times [2018-11-10 04:11:33,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:33,922 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 04:11:33,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:33,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:33,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:33,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:33,946 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 04:11:33,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 04:11:33,977 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:11:33,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:11:33,977 INFO L87 Difference]: Start difference. First operand 591 states and 727 transitions. cyclomatic complexity: 145 Second operand 7 states. [2018-11-10 04:11:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:34,050 INFO L93 Difference]: Finished difference Result 617 states and 751 transitions. [2018-11-10 04:11:34,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:11:34,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 617 states and 751 transitions. [2018-11-10 04:11:34,056 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2018-11-10 04:11:34,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 617 states to 607 states and 737 transitions. [2018-11-10 04:11:34,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-10 04:11:34,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2018-11-10 04:11:34,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 607 states and 737 transitions. [2018-11-10 04:11:34,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:34,061 INFO L705 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 04:11:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states and 737 transitions. [2018-11-10 04:11:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-11-10 04:11:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-10 04:11:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 737 transitions. [2018-11-10 04:11:34,074 INFO L728 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 04:11:34,074 INFO L608 BuchiCegarLoop]: Abstraction has 607 states and 737 transitions. [2018-11-10 04:11:34,074 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:11:34,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 737 transitions. [2018-11-10 04:11:34,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2018-11-10 04:11:34,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:34,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:34,078 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 04:11:34,078 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 04:11:34,080 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~ret3;havoc #t~ret2; 10234#fibo2FINAL assume true; 10237#fibo2EXIT >#50#return; 10407#L13-1 [2018-11-10 04:11:34,080 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~ret0;havoc #t~ret1; 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 04:11:34,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 2 times [2018-11-10 04:11:34,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:34,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1807088251, now seen corresponding path program 1 times [2018-11-10 04:11:34,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,174 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 04:11:34,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:34,175 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:34,202 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 04:11:34,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:34,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 04:11:34,230 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:11:34,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:11:34,230 INFO L87 Difference]: Start difference. First operand 607 states and 737 transitions. cyclomatic complexity: 139 Second operand 10 states. [2018-11-10 04:11:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:34,478 INFO L93 Difference]: Finished difference Result 381 states and 479 transitions. [2018-11-10 04:11:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:11:34,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 479 transitions. [2018-11-10 04:11:34,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-10 04:11:34,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 277 states and 336 transitions. [2018-11-10 04:11:34,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2018-11-10 04:11:34,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2018-11-10 04:11:34,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 336 transitions. [2018-11-10 04:11:34,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:34,488 INFO L705 BuchiCegarLoop]: Abstraction has 277 states and 336 transitions. [2018-11-10 04:11:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 336 transitions. [2018-11-10 04:11:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2018-11-10 04:11:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 04:11:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 325 transitions. [2018-11-10 04:11:34,497 INFO L728 BuchiCegarLoop]: Abstraction has 271 states and 325 transitions. [2018-11-10 04:11:34,497 INFO L608 BuchiCegarLoop]: Abstraction has 271 states and 325 transitions. [2018-11-10 04:11:34,497 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:11:34,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 325 transitions. [2018-11-10 04:11:34,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-11-10 04:11:34,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:34,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:34,502 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 04:11:34,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:34,503 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~ret3;havoc #t~ret2; 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 04:11:34,503 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 04:11:34,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2079695015, now seen corresponding path program 1 times [2018-11-10 04:11:34,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,595 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 04:11:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:34,596 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:34,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:34,711 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 04:11:34,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:34,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-10 04:11:34,741 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:34,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1790571152, now seen corresponding path program 2 times [2018-11-10 04:11:34,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,765 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 04:11:34,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:34,765 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:34,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:11:34,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:11:34,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:11:34,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:34,786 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 04:11:34,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:34,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 04:11:34,811 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:11:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:11:34,812 INFO L87 Difference]: Start difference. First operand 271 states and 325 transitions. cyclomatic complexity: 59 Second operand 7 states. [2018-11-10 04:11:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:34,885 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2018-11-10 04:11:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:11:34,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 258 transitions. [2018-11-10 04:11:34,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 04:11:34,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 196 states and 234 transitions. [2018-11-10 04:11:34,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-11-10 04:11:34,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 04:11:34,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 234 transitions. [2018-11-10 04:11:34,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:34,891 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 234 transitions. [2018-11-10 04:11:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 234 transitions. [2018-11-10 04:11:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2018-11-10 04:11:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 04:11:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2018-11-10 04:11:34,899 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-10 04:11:34,899 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-10 04:11:34,899 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:11:34,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 211 transitions. [2018-11-10 04:11:34,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 04:11:34,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:34,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:34,901 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 04:11:34,901 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 04:11:34,901 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~ret3;havoc #t~ret2; 12138#fibo2FINAL assume true; 12122#fibo2EXIT >#50#return; 12034#L13-1 [2018-11-10 04:11:34,901 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~ret3;havoc #t~ret2; 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~ret0;havoc #t~ret1; 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~ret3;havoc #t~ret2; 12117#fibo2FINAL assume true; 12109#fibo2EXIT >#50#return; 12034#L13-1 [2018-11-10 04:11:34,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 3 times [2018-11-10 04:11:34,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:34,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1747231413, now seen corresponding path program 1 times [2018-11-10 04:11:34,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:34,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:34,988 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 04:11:34,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:34,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:34,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:35,044 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 04:11:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-10 04:11:35,061 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:11:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:11:35,062 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. cyclomatic complexity: 36 Second operand 11 states. [2018-11-10 04:11:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:35,125 INFO L93 Difference]: Finished difference Result 184 states and 213 transitions. [2018-11-10 04:11:35,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:11:35,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 213 transitions. [2018-11-10 04:11:35,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 04:11:35,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 178 states and 207 transitions. [2018-11-10 04:11:35,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-10 04:11:35,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-10 04:11:35,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 207 transitions. [2018-11-10 04:11:35,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:35,129 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 04:11:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 207 transitions. [2018-11-10 04:11:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-11-10 04:11:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 04:11:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2018-11-10 04:11:35,133 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 04:11:35,133 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-11-10 04:11:35,133 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 04:11:35,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 207 transitions. [2018-11-10 04:11:35,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 04:11:35,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:35,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:35,135 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 04:11:35,135 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 04:11:35,135 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~ret3;havoc #t~ret2; 12684#fibo2FINAL assume true; 12669#fibo2EXIT >#50#return; 12652#L13-1 [2018-11-10 04:11:35,135 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~ret3;havoc #t~ret2; 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~ret0;havoc #t~ret1; 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~ret3;havoc #t~ret2; 12664#fibo2FINAL assume true; 12656#fibo2EXIT >#50#return; 12652#L13-1 [2018-11-10 04:11:35,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 4 times [2018-11-10 04:11:35,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1582059376, now seen corresponding path program 1 times [2018-11-10 04:11:35,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,237 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 04:11:35,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:35,238 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:11:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:35,316 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 04:11:35,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:35,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-11-10 04:11:35,332 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:11:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:11:35,332 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. cyclomatic complexity: 32 Second operand 17 states. [2018-11-10 04:11:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:35,495 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2018-11-10 04:11:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 04:11:35,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 207 transitions. [2018-11-10 04:11:35,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 04:11:35,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 137 states and 146 transitions. [2018-11-10 04:11:35,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2018-11-10 04:11:35,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2018-11-10 04:11:35,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 146 transitions. [2018-11-10 04:11:35,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:35,499 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 146 transitions. [2018-11-10 04:11:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 146 transitions. [2018-11-10 04:11:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2018-11-10 04:11:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 04:11:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-11-10 04:11:35,502 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-11-10 04:11:35,502 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-11-10 04:11:35,502 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 04:11:35,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 136 transitions. [2018-11-10 04:11:35,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 04:11:35,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:35,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:35,503 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 04:11:35,503 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 04:11:35,504 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~ret3;havoc #t~ret2; 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 04:11:35,504 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~ret3;havoc #t~ret2; 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 04:11:35,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2127928097, now seen corresponding path program 1 times [2018-11-10 04:11:35,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,574 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 04:11:35,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:35,575 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:35,700 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 04:11:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-11-10 04:11:35,727 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:11:35,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1849950214, now seen corresponding path program 2 times [2018-11-10 04:11:35,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:35,835 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 04:11:35,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:11:35,836 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:35,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:11:35,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:11:35,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:11:35,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:35,858 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 04:11:35,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:11:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 04:11:35,876 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:11:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:11:35,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:11:35,876 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-10 04:11:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:11:35,968 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-11-10 04:11:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:11:35,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 140 transitions. [2018-11-10 04:11:35,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 04:11:35,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 82 states and 84 transitions. [2018-11-10 04:11:35,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 04:11:35,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-10 04:11:35,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2018-11-10 04:11:35,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:11:35,970 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-10 04:11:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2018-11-10 04:11:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-10 04:11:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:11:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-10 04:11:35,971 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 04:11:35,971 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 04:11:35,972 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 04:11:35,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 72 transitions. [2018-11-10 04:11:35,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 04:11:35,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:11:35,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:11:35,972 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 04:11:35,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:11:35,973 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~ret3;havoc #t~ret2; 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~ret0;havoc #t~ret1; 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~ret0;havoc #t~ret1; 13718#fibo1FINAL assume true; 13739#fibo1EXIT >#48#return; 13689#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13681#fibo2FINAL assume true; 13682#fibo2EXIT >#50#return; 13677#L13-1 call #t~ret1 := fibo2(~n - 2);< 13692#fibo2ENTRY [2018-11-10 04:11:35,973 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 04:11:35,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash 730842524, now seen corresponding path program 1 times [2018-11-10 04:11:35,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2018-11-10 04:11:35,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:11:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:35,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1716080253, now seen corresponding path program 2 times [2018-11-10 04:11:35,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:11:35,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:11:35,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:11:35,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:11:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:11:36,104 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:36,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:36,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:36,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:36,105 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:11:36,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:36,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:36,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:36,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration12_Loop [2018-11-10 04:11:36,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:36,105 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:36,106 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 04:11:36,110 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 04:11:36,111 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 04:11:36,112 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 04:11:36,113 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 04:11:36,114 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 04:11:36,115 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 04:11:36,116 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 04:11:36,117 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 04:11:36,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 04:11:36,146 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:36,146 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,151 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,151 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,170 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,170 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,189 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,189 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,208 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,208 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,228 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,228 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,248 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,248 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,268 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,268 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,287 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:11:36,288 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_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:11:36,305 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d29db598-8262-4a4d-84de-cf1870bb9bf4/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 04:11:36,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:11:36,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:11:36,340 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:11:36,341 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:11:36,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:11:36,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:11:36,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:11:36,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:11:36,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:11:36,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:11:36,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:11:36,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_true-unreach-call_true-termination.c_Iteration12_Loop [2018-11-10 04:11:36,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:11:36,342 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:11:36,342 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 04:11:36,344 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 04:11:36,345 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 04:11:36,346 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 04:11:36,347 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 04:11:36,348 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 04:11:36,349 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 04:11:36,350 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 04:11:36,351 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 04:11:36,355 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 04:11:36,386 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:11:36,386 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:11:36,386 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 04:11:36,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,389 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 04:11:36,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,391 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 04:11:36,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,393 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 04:11:36,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,394 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 04:11:36,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,396 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 04:11:36,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,398 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 04:11:36,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,400 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 04:11:36,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:11:36,402 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 04:11:36,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:11:36,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:11:36,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:11:36,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:11:36,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:11:36,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:11:36,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:11:36,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:11:36,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:11:36,405 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:11:36,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:11:36,406 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:11:36,406 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:11:36,406 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-10 04:11:36,406 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:11:36,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,566 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 04:11:36,566 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 04:11:36,567 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 04:11:36,611 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 04:11:36,611 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 04:11:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 04:11:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 04:11:36,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 04:11:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:36,612 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:11:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:11:36,700 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 04:11:36,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 04:11:36,743 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 04:11:36,744 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 04:11:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 04:11:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 04:11:36,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 04:11:36,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:36,744 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:11:36,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:11:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:11:36,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:11:36,844 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 04:11:36,844 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 04:11:36,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 04:11:36,928 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 04:11:36,929 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 04:11:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 04:11:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-10 04:11:36,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 04:11:36,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:36,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 71 letters. Loop has 8 letters. [2018-11-10 04:11:36,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:36,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 63 letters. Loop has 16 letters. [2018-11-10 04:11:36,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:11:36,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-11-10 04:11:36,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:11:36,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-11-10 04:11:36,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:11:36,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:11:36,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:11:36,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:11:36,932 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:11:36,932 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:11:36,932 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:11:36,932 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 04:11:36,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:11:36,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:11:36,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:11:36,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:11:36 BoogieIcfgContainer [2018-11-10 04:11:36,939 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:11:36,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:11:36,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:11:36,940 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:11:36,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:11:26" (3/4) ... [2018-11-10 04:11:36,944 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:11:36,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:11:36,945 INFO L168 Benchmark]: Toolchain (without parser) took 10402.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -81.8 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:11:36,947 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:11:36,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:11:36,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.83 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:11:36,948 INFO L168 Benchmark]: Boogie Preprocessor took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:11:36,948 INFO L168 Benchmark]: RCFGBuilder took 236.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:11:36,948 INFO L168 Benchmark]: BuchiAutomizer took 9956.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:11:36,949 INFO L168 Benchmark]: Witness Printer took 4.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:11:36,952 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.83 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9956.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 9.9s and 13 iterations. TraceHistogramMax:8. Analysis of lassos took 5.7s. Construction of modules took 1.2s. Büchi inclusion checks took 2.5s. 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: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...