./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:20:33,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:20:33,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:20:33,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:20:33,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:20:33,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:20:33,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:20:33,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:20:33,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:20:33,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:20:33,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:20:33,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:20:33,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:20:33,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:20:33,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:20:33,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:20:33,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:20:33,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:20:33,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:20:33,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:20:33,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:20:33,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:20:33,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:20:33,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:20:33,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:20:33,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:20:33,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:20:33,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:20:33,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:20:33,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:20:33,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:20:33,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:20:33,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:20:33,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:20:33,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:20:33,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:20:33,649 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:20:33,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:20:33,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:20:33,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:20:33,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:20:33,662 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:20:33,662 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:20:33,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:20:33,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:20:33,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:20:33,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:20:33,665 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:20:33,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:20:33,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:20:33,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:20:33,665 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:20:33,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:20:33,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:20:33,666 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:20:33,667 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:20:33,667 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-10 07:20:33,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:20:33,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:20:33,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:20:33,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:20:33,704 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:20:33,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 07:20:33,749 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/data/3f9fd7574/142128a93c47444b92e9601d660c6f70/FLAG3b823604a [2018-11-10 07:20:34,073 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:20:34,073 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 07:20:34,078 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/data/3f9fd7574/142128a93c47444b92e9601d660c6f70/FLAG3b823604a [2018-11-10 07:20:34,086 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/data/3f9fd7574/142128a93c47444b92e9601d660c6f70 [2018-11-10 07:20:34,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:20:34,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:20:34,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:20:34,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:20:34,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:20:34,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34, skipping insertion in model container [2018-11-10 07:20:34,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:20:34,117 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:20:34,235 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:20:34,237 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:20:34,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:20:34,257 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:20:34,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34 WrapperNode [2018-11-10 07:20:34,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:20:34,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:20:34,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:20:34,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:20:34,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:20:34,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:20:34,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:20:34,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:20:34,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... [2018-11-10 07:20:34,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:20:34,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:20:34,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:20:34,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:20:34,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:20:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:20:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 07:20:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 07:20:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 07:20:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 07:20:34,468 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:20:34,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:34 BoogieIcfgContainer [2018-11-10 07:20:34,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:20:34,469 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:20:34,469 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:20:34,471 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:20:34,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:20:34,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:20:34" (1/3) ... [2018-11-10 07:20:34,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f0cad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:20:34, skipping insertion in model container [2018-11-10 07:20:34,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:20:34,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:34" (2/3) ... [2018-11-10 07:20:34,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f0cad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:20:34, skipping insertion in model container [2018-11-10 07:20:34,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:20:34,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:34" (3/3) ... [2018-11-10 07:20:34,474 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-10 07:20:34,505 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:20:34,505 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:20:34,505 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:20:34,505 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:20:34,505 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:20:34,505 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:20:34,506 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:20:34,506 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:20:34,506 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:20:34,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:20:34,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:34,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:34,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:34,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:20:34,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:34,540 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:20:34,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:20:34,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:34,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:34,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:34,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:20:34,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:34,546 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 := 6; 17#L37true call main_#t~ret4 := fibo1(main_~x~0);< 25#fibo1ENTRYtrue [2018-11-10 07:20:34,547 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 07:20:34,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2018-11-10 07:20:34,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:34,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2018-11-10 07:20:34,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2018-11-10 07:20:34,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:34,778 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:34,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:34,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:34,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:34,779 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:34,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:34,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:34,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:34,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 07:20:34,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:34,780 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:34,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 07:20:34,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 07:20:34,810 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 07:20:34,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 07:20:34,827 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 07:20:34,835 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 07:20:34,837 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 07:20:34,839 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 07:20:34,840 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 07:20:34,842 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 07:20:34,898 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:34,899 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:34,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:34,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:34,916 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:34,916 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:34,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:34,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:34,938 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:34,938 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:34,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:34,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:34,967 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:34,967 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:34,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:34,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:34,985 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:34,985 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,004 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:35,004 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,029 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:35,030 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,047 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:35,048 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,067 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:35,067 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,086 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:35,086 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:35,102 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:35,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:35,174 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:35,175 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:35,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:35,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:35,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:35,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:35,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:35,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:35,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:35,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 07:20:35,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:35,176 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:35,177 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 07:20:35,178 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 07:20:35,179 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 07:20:35,180 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 07:20:35,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:35,183 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 07:20:35,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:35,185 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 07:20:35,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:35,191 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 07:20:35,268 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:35,272 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:35,274 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 07:20:35,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,281 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 07:20:35,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,284 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 07:20:35,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,287 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 07:20:35,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,291 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 07:20:35,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,294 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 07:20:35,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,297 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 07:20:35,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,300 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 07:20:35,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:35,304 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 07:20:35,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:35,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:35,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:35,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:35,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:35,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:35,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:35,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:35,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:35,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:35,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:35,317 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:35,317 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:35,317 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 07:20:35,323 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:35,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:35,488 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 07:20:35,502 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 07:20:35,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 6 states. [2018-11-10 07:20:35,650 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 07:20:35,650 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 07:20:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:20:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-10 07:20:35,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 07:20:35,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:35,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 07:20:35,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:35,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-10 07:20:35,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:35,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2018-11-10 07:20:35,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:35,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2018-11-10 07:20:35,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 07:20:35,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 07:20:35,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2018-11-10 07:20:35,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:35,670 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-10 07:20:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2018-11-10 07:20:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-10 07:20:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 07:20:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 07:20:35,695 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 07:20:35,695 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 07:20:35,695 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:20:35,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2018-11-10 07:20:35,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:35,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:35,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:35,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:35,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:35,697 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 := 6; 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 07:20:35,697 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 07:20:35,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2018-11-10 07:20:35,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,762 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 07:20:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:35,766 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:35,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2018-11-10 07:20:35,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:35,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,797 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 07:20:35,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:35,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:35,798 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:20:35,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:20:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:20:35,801 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-10 07:20:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:35,864 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-10 07:20:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:20:35,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-10 07:20:35,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:35,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2018-11-10 07:20:35,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 07:20:35,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 07:20:35,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2018-11-10 07:20:35,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:35,869 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-10 07:20:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2018-11-10 07:20:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-10 07:20:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 07:20:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-11-10 07:20:35,874 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 07:20:35,874 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-10 07:20:35,874 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:20:35,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2018-11-10 07:20:35,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:20:35,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:35,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:35,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:35,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:35,877 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 := 6; 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 07:20:35,877 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 07:20:35,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2018-11-10 07:20:35,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,937 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 07:20:35,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:35,937 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:35,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:35,958 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 07:20:35,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:35,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 07:20:35,975 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:35,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2018-11-10 07:20:35,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:35,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:36,077 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:36,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:36,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:36,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:36,077 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:36,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:36,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:36,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:36,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 07:20:36,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:36,078 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:36,079 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 07:20:36,080 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 07:20:36,081 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 07:20:36,085 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 07:20:36,086 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 07:20:36,088 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 07:20:36,089 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 07:20:36,090 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 07:20:36,091 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 07:20:36,117 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:36,117 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:36,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:36,120 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:36,122 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:36,122 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:36,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:36,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:36,140 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:36,140 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:36,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:36,156 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:36,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:36,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:37,023 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:37,025 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:37,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:37,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:37,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:37,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:37,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:37,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:37,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:37,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 07:20:37,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:37,025 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:37,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 07:20:37,028 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 07:20:37,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 07:20:37,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:37,034 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 07:20:37,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:37,036 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 07:20:37,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:37,038 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 07:20:37,064 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:37,065 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:37,065 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 07:20:37,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:37,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:37,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:37,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:37,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:37,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:37,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:37,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:37,069 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 07:20:37,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:37,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:37,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:37,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:37,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:37,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:37,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:37,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:37,071 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 07:20:37,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:37,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:37,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:37,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:37,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:37,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:37,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:37,076 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:37,079 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:37,079 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:37,080 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:37,080 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:37,080 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:37,080 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-10 07:20:37,081 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:37,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:37,189 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 07:20:37,189 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 07:20:37,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-10 07:20:37,393 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 07:20:37,394 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 07:20:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 07:20:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-10 07:20:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-10 07:20:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 30 letters. Loop has 14 letters. [2018-11-10 07:20:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 28 letters. [2018-11-10 07:20:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:37,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. [2018-11-10 07:20:37,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 07:20:37,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2018-11-10 07:20:37,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 07:20:37,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 07:20:37,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2018-11-10 07:20:37,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:37,405 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2018-11-10 07:20:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2018-11-10 07:20:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-10 07:20:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 07:20:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2018-11-10 07:20:37,414 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2018-11-10 07:20:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:20:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:20:37,415 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand 9 states. [2018-11-10 07:20:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:37,490 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2018-11-10 07:20:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:20:37,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 244 transitions. [2018-11-10 07:20:37,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 07:20:37,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 240 transitions. [2018-11-10 07:20:37,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-10 07:20:37,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-10 07:20:37,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 240 transitions. [2018-11-10 07:20:37,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:37,499 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 240 transitions. [2018-11-10 07:20:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 240 transitions. [2018-11-10 07:20:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-11-10 07:20:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 07:20:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2018-11-10 07:20:37,511 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 07:20:37,511 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-10 07:20:37,511 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:20:37,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 225 transitions. [2018-11-10 07:20:37,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 07:20:37,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:37,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:37,517 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 07:20:37,517 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 07:20:37,517 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 := 6; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 07:20:37,518 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~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-10 07:20:37,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash 376035563, now seen corresponding path program 1 times [2018-11-10 07:20:37,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:37,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,566 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 07:20:37,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:37,566 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:37,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 07:20:37,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:20:37,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 07:20:37,635 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:37,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 36254641, now seen corresponding path program 1 times [2018-11-10 07:20:37,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:37,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,699 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 07:20:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:37,699 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:37,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:37,739 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 07:20:37,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:20:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 07:20:37,755 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:20:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:20:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:20:37,756 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-10 07:20:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:37,782 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2018-11-10 07:20:37,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:20:37,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 236 transitions. [2018-11-10 07:20:37,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 07:20:37,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 172 states and 222 transitions. [2018-11-10 07:20:37,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 07:20:37,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 07:20:37,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 222 transitions. [2018-11-10 07:20:37,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:37,791 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 222 transitions. [2018-11-10 07:20:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 222 transitions. [2018-11-10 07:20:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2018-11-10 07:20:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 07:20:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2018-11-10 07:20:37,800 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 07:20:37,800 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-10 07:20:37,800 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:20:37,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 206 transitions. [2018-11-10 07:20:37,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 07:20:37,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:37,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:37,805 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 07:20:37,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 07:20:37,806 INFO L793 eck$LassoCheckResult]: Stem: 1925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1919#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 := 6; 1894#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1900#fibo1ENTRY ~n := #in~n; 1932#L8 assume !(~n < 1); 1893#L10 assume !(~n == 1); 1895#L13 call #t~ret0 := fibo2(~n - 1);< 1909#fibo2ENTRY ~n := #in~n; 1927#L18 assume !(~n < 1); 1934#L20 assume !(~n == 1); 1915#L23 call #t~ret2 := fibo1(~n - 1);< 1881#fibo1ENTRY ~n := #in~n; 1923#L8 assume !(~n < 1); 1968#L10 assume !(~n == 1); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1963#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1965#L20 assume !(~n == 1); 1878#L23 call #t~ret2 := fibo1(~n - 1);< 1881#fibo1ENTRY ~n := #in~n; 1923#L8 assume !(~n < 1); 1968#L10 assume !(~n == 1); 1879#L13 call #t~ret0 := fibo2(~n - 1);< 1963#fibo2ENTRY ~n := #in~n; 1967#L18 assume !(~n < 1); 1965#L20 assume ~n == 1;#res := 1; 1962#fibo2FINAL assume true; 1930#fibo2EXIT >#50#return; 1880#L13-1 call #t~ret1 := fibo2(~n - 2);< 1916#fibo2ENTRY ~n := #in~n; 2012#L18 assume !(~n < 1); 2011#L20 assume !(~n == 1); 1878#L23 call #t~ret2 := fibo1(~n - 1);< 1881#fibo1ENTRY ~n := #in~n; 1924#L8 assume !(~n < 1); 1971#L10 assume ~n == 1;#res := 1; 1970#fibo1FINAL assume true; 1969#fibo1EXIT >#46#return; 1891#L23-1 call #t~ret3 := fibo1(~n - 2);< 1899#fibo1ENTRY ~n := #in~n; 1959#L8 assume !(~n < 1); 1957#L10 assume !(~n == 1); 1898#L13 call #t~ret0 := fibo2(~n - 1);< 1955#fibo2ENTRY ~n := #in~n; 1953#L18 assume !(~n < 1); 1947#L20 assume ~n == 1;#res := 1; 1948#fibo2FINAL assume true; 1928#fibo2EXIT >#50#return; 1929#L13-1 call #t~ret1 := fibo2(~n - 2);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume ~n < 1;#res := 0; 1937#fibo2FINAL assume true; 2018#fibo2EXIT >#52#return; 1988#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2017#fibo1FINAL assume true; 2007#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1993#fibo2FINAL assume true; 1987#fibo2EXIT >#52#return; 1988#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2017#fibo1FINAL assume true; 2007#fibo1EXIT >#46#return; 1991#L23-1 call #t~ret3 := fibo1(~n - 2);< 2002#fibo1ENTRY ~n := #in~n; 1998#L8 assume !(~n < 1); 1995#L10 assume !(~n == 1); 1936#L13 call #t~ret0 := fibo2(~n - 1);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume !(~n < 1); 1938#L20 assume ~n == 1;#res := 1; 2005#fibo2FINAL assume true; 2004#fibo2EXIT >#50#return; 1929#L13-1 call #t~ret1 := fibo2(~n - 2);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume ~n < 1;#res := 0; 1937#fibo2FINAL assume true; 2018#fibo2EXIT >#52#return; 1988#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2017#fibo1FINAL assume true; 2007#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1993#fibo2FINAL assume true; 1987#fibo2EXIT >#50#return; 1929#L13-1 [2018-11-10 07:20:37,806 INFO L795 eck$LassoCheckResult]: Loop: 1929#L13-1 call #t~ret1 := fibo2(~n - 2);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume !(~n < 1); 1938#L20 assume !(~n == 1); 1990#L23 call #t~ret2 := fibo1(~n - 1);< 2002#fibo1ENTRY ~n := #in~n; 1998#L8 assume !(~n < 1); 1995#L10 assume !(~n == 1); 1936#L13 call #t~ret0 := fibo2(~n - 1);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume !(~n < 1); 1938#L20 assume !(~n == 1); 1990#L23 call #t~ret2 := fibo1(~n - 1);< 2002#fibo1ENTRY ~n := #in~n; 1998#L8 assume !(~n < 1); 1995#L10 assume !(~n == 1); 1936#L13 call #t~ret0 := fibo2(~n - 1);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume !(~n < 1); 1938#L20 assume ~n == 1;#res := 1; 2005#fibo2FINAL assume true; 2004#fibo2EXIT >#50#return; 1929#L13-1 call #t~ret1 := fibo2(~n - 2);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume ~n < 1;#res := 0; 1937#fibo2FINAL assume true; 2018#fibo2EXIT >#52#return; 1988#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2017#fibo1FINAL assume true; 2007#fibo1EXIT >#46#return; 1991#L23-1 call #t~ret3 := fibo1(~n - 2);< 2002#fibo1ENTRY ~n := #in~n; 1998#L8 assume !(~n < 1); 1995#L10 assume !(~n == 1); 1936#L13 call #t~ret0 := fibo2(~n - 1);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume !(~n < 1); 1938#L20 assume ~n == 1;#res := 1; 2005#fibo2FINAL assume true; 2004#fibo2EXIT >#50#return; 1929#L13-1 call #t~ret1 := fibo2(~n - 2);< 1914#fibo2ENTRY ~n := #in~n; 1935#L18 assume ~n < 1;#res := 0; 1937#fibo2FINAL assume true; 2018#fibo2EXIT >#52#return; 1988#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2017#fibo1FINAL assume true; 2007#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1993#fibo2FINAL assume true; 1987#fibo2EXIT >#50#return; 1929#L13-1 [2018-11-10 07:20:37,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash 821073247, now seen corresponding path program 2 times [2018-11-10 07:20:37,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 07:20:37,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:37,917 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:20:37,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:20:37,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:20:37,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 07:20:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-10 07:20:37,975 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:37,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1445694181, now seen corresponding path program 1 times [2018-11-10 07:20:37,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 07:20:38,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:38,075 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:20:38,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 07:20:38,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:38,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-11-10 07:20:38,149 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:20:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 07:20:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:20:38,149 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 13 states. [2018-11-10 07:20:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:38,382 INFO L93 Difference]: Finished difference Result 209 states and 285 transitions. [2018-11-10 07:20:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:20:38,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 285 transitions. [2018-11-10 07:20:38,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 07:20:38,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 285 transitions. [2018-11-10 07:20:38,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2018-11-10 07:20:38,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2018-11-10 07:20:38,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 285 transitions. [2018-11-10 07:20:38,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:38,389 INFO L705 BuchiCegarLoop]: Abstraction has 209 states and 285 transitions. [2018-11-10 07:20:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 285 transitions. [2018-11-10 07:20:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2018-11-10 07:20:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 07:20:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 263 transitions. [2018-11-10 07:20:38,401 INFO L728 BuchiCegarLoop]: Abstraction has 192 states and 263 transitions. [2018-11-10 07:20:38,401 INFO L608 BuchiCegarLoop]: Abstraction has 192 states and 263 transitions. [2018-11-10 07:20:38,401 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:20:38,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 263 transitions. [2018-11-10 07:20:38,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-10 07:20:38,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:38,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:38,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:38,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:38,406 INFO L793 eck$LassoCheckResult]: Stem: 2745#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2738#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 := 6; 2708#L37 call main_#t~ret4 := fibo1(main_~x~0);< 2709#fibo1ENTRY ~n := #in~n; 2785#L8 assume !(~n < 1); 2784#L10 assume !(~n == 1); 2727#L13 call #t~ret0 := fibo2(~n - 1);< 2728#fibo2ENTRY ~n := #in~n; 2747#L18 assume !(~n < 1); 2753#L20 assume !(~n == 1); 2732#L23 call #t~ret2 := fibo1(~n - 1);< 2840#fibo1ENTRY ~n := #in~n; 2841#L8 assume !(~n < 1); 2838#L10 assume !(~n == 1); 2698#L13 call #t~ret0 := fibo2(~n - 1);< 2781#fibo2ENTRY ~n := #in~n; 2845#L18 assume !(~n < 1); 2844#L20 assume ~n == 1;#res := 1; 2697#fibo2FINAL assume true; 2699#fibo2EXIT >#50#return; 2693#L13-1 call #t~ret1 := fibo2(~n - 2);< 2734#fibo2ENTRY ~n := #in~n; 2846#L18 assume !(~n < 1); 2752#L20 assume !(~n == 1); 2691#L23 call #t~ret2 := fibo1(~n - 1);< 2694#fibo1ENTRY ~n := #in~n; 2743#L8 assume !(~n < 1); 2707#L10 assume !(~n == 1); 2692#L13 call #t~ret0 := fibo2(~n - 1);< 2787#fibo2ENTRY ~n := #in~n; 2786#L18 assume !(~n < 1); 2783#L20 assume !(~n == 1); 2691#L23 call #t~ret2 := fibo1(~n - 1);< 2694#fibo1ENTRY ~n := #in~n; 2744#L8 assume !(~n < 1); 2790#L10 assume ~n == 1;#res := 1; 2789#fibo1FINAL assume true; 2788#fibo1EXIT >#46#return; 2741#L23-1 call #t~ret3 := fibo1(~n - 2);< 2739#fibo1ENTRY ~n := #in~n; 2742#L8 assume ~n < 1;#res := 0; 2875#fibo1FINAL assume true; 2825#fibo1EXIT >#48#return; 2821#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2820#fibo2FINAL assume true; 2810#fibo2EXIT >#50#return; 2807#L13-1 [2018-11-10 07:20:38,406 INFO L795 eck$LassoCheckResult]: Loop: 2807#L13-1 call #t~ret1 := fibo2(~n - 2);< 2818#fibo2ENTRY ~n := #in~n; 2864#L18 assume !(~n < 1); 2862#L20 assume !(~n == 1); 2813#L23 call #t~ret2 := fibo1(~n - 1);< 2834#fibo1ENTRY ~n := #in~n; 2831#L8 assume !(~n < 1); 2829#L10 assume !(~n == 1); 2808#L13 call #t~ret0 := fibo2(~n - 1);< 2818#fibo2ENTRY ~n := #in~n; 2864#L18 assume !(~n < 1); 2862#L20 assume !(~n == 1); 2813#L23 call #t~ret2 := fibo1(~n - 1);< 2834#fibo1ENTRY ~n := #in~n; 2831#L8 assume !(~n < 1); 2829#L10 assume !(~n == 1); 2808#L13 call #t~ret0 := fibo2(~n - 1);< 2818#fibo2ENTRY ~n := #in~n; 2864#L18 assume !(~n < 1); 2862#L20 assume ~n == 1;#res := 1; 2848#fibo2FINAL assume true; 2823#fibo2EXIT >#50#return; 2807#L13-1 call #t~ret1 := fibo2(~n - 2);< 2818#fibo2ENTRY ~n := #in~n; 2864#L18 assume ~n < 1;#res := 0; 2851#fibo2FINAL assume true; 2849#fibo2EXIT >#52#return; 2809#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2860#fibo1FINAL assume true; 2836#fibo1EXIT >#46#return; 2815#L23-1 call #t~ret3 := fibo1(~n - 2);< 2834#fibo1ENTRY ~n := #in~n; 2831#L8 assume ~n < 1;#res := 0; 2832#fibo1FINAL assume true; 2861#fibo1EXIT >#48#return; 2827#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2819#fibo2FINAL assume true; 2806#fibo2EXIT >#50#return; 2807#L13-1 [2018-11-10 07:20:38,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1519288695, now seen corresponding path program 1 times [2018-11-10 07:20:38,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:38,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:20:38,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:38,443 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:20:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 07:20:38,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-10 07:20:38,534 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:38,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1513837346, now seen corresponding path program 1 times [2018-11-10 07:20:38,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:38,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:20:38,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:38,600 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:20:38,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:20:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:38,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-10 07:20:38,681 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:20:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:20:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:20:38,681 INFO L87 Difference]: Start difference. First operand 192 states and 263 transitions. cyclomatic complexity: 78 Second operand 11 states. [2018-11-10 07:20:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:38,771 INFO L93 Difference]: Finished difference Result 229 states and 318 transitions. [2018-11-10 07:20:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:20:38,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 318 transitions. [2018-11-10 07:20:38,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2018-11-10 07:20:38,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 229 states and 318 transitions. [2018-11-10 07:20:38,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-10 07:20:38,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-10 07:20:38,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 318 transitions. [2018-11-10 07:20:38,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:38,777 INFO L705 BuchiCegarLoop]: Abstraction has 229 states and 318 transitions. [2018-11-10 07:20:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 318 transitions. [2018-11-10 07:20:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 211. [2018-11-10 07:20:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-10 07:20:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2018-11-10 07:20:38,786 INFO L728 BuchiCegarLoop]: Abstraction has 211 states and 293 transitions. [2018-11-10 07:20:38,786 INFO L608 BuchiCegarLoop]: Abstraction has 211 states and 293 transitions. [2018-11-10 07:20:38,786 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:20:38,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 293 transitions. [2018-11-10 07:20:38,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2018-11-10 07:20:38,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:38,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:38,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:38,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:38,789 INFO L793 eck$LassoCheckResult]: Stem: 3439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3438#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 := 6; 3395#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3396#fibo1ENTRY ~n := #in~n; 3496#L8 assume !(~n < 1); 3497#L10 assume !(~n == 1); 3427#L13 call #t~ret0 := fibo2(~n - 1);< 3428#fibo2ENTRY ~n := #in~n; 3464#L18 assume !(~n < 1); 3465#L20 assume !(~n == 1); 3403#L23 call #t~ret2 := fibo1(~n - 1);< 3441#fibo1ENTRY ~n := #in~n; 3443#L8 assume !(~n < 1); 3401#L10 assume !(~n == 1); 3404#L13 call #t~ret0 := fibo2(~n - 1);< 3447#fibo2ENTRY ~n := #in~n; 3448#L18 assume !(~n < 1); 3540#L20 assume ~n == 1;#res := 1; 3407#fibo2FINAL assume true; 3408#fibo2EXIT >#50#return; 3392#L13-1 call #t~ret1 := fibo2(~n - 2);< 3434#fibo2ENTRY ~n := #in~n; 3514#L18 assume !(~n < 1); 3460#L20 assume !(~n == 1); 3391#L23 call #t~ret2 := fibo1(~n - 1);< 3394#fibo1ENTRY ~n := #in~n; 3455#L8 assume !(~n < 1); 3456#L10 assume !(~n == 1); 3393#L13 call #t~ret0 := fibo2(~n - 1);< 3486#fibo2ENTRY ~n := #in~n; 3503#L18 assume !(~n < 1); 3502#L20 assume !(~n == 1); 3391#L23 call #t~ret2 := fibo1(~n - 1);< 3394#fibo1ENTRY ~n := #in~n; 3442#L8 assume !(~n < 1); 3510#L10 assume ~n == 1;#res := 1; 3511#fibo1FINAL assume true; 3578#fibo1EXIT >#46#return; 3494#L23-1 call #t~ret3 := fibo1(~n - 2);< 3576#fibo1ENTRY ~n := #in~n; 3593#L8 assume ~n < 1;#res := 0; 3582#fibo1FINAL assume true; 3574#fibo1EXIT >#48#return; 3572#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 3569#fibo2FINAL assume true; 3549#fibo2EXIT >#50#return; 3516#L13-1 [2018-11-10 07:20:38,789 INFO L795 eck$LassoCheckResult]: Loop: 3516#L13-1 call #t~ret1 := fibo2(~n - 2);< 3546#fibo2ENTRY ~n := #in~n; 3544#L18 assume !(~n < 1); 3541#L20 assume !(~n == 1); 3530#L23 call #t~ret2 := fibo1(~n - 1);< 3538#fibo1ENTRY ~n := #in~n; 3555#L8 assume !(~n < 1); 3547#L10 assume !(~n == 1); 3537#L13 call #t~ret0 := fibo2(~n - 1);< 3546#fibo2ENTRY ~n := #in~n; 3544#L18 assume !(~n < 1); 3541#L20 assume !(~n == 1); 3530#L23 call #t~ret2 := fibo1(~n - 1);< 3538#fibo1ENTRY ~n := #in~n; 3555#L8 assume !(~n < 1); 3547#L10 assume ~n == 1;#res := 1; 3548#fibo1FINAL assume true; 3561#fibo1EXIT >#46#return; 3531#L23-1 call #t~ret3 := fibo1(~n - 2);< 3538#fibo1ENTRY ~n := #in~n; 3555#L8 assume ~n < 1;#res := 0; 3556#fibo1FINAL assume true; 3559#fibo1EXIT >#48#return; 3560#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 3564#fibo2FINAL assume true; 3552#fibo2EXIT >#50#return; 3516#L13-1 [2018-11-10 07:20:38,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1519288695, now seen corresponding path program 2 times [2018-11-10 07:20:38,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:38,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:20:38,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:38,835 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:20:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:20:38,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:20:38,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:20:38,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 07:20:38,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:38,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-10 07:20:38,934 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:38,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1626884941, now seen corresponding path program 1 times [2018-11-10 07:20:38,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:39,101 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:39,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:39,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:39,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:39,101 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:39,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:39,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:39,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:39,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 07:20:39,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:39,101 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:39,102 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 07:20:39,103 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 07:20:39,105 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 07:20:39,105 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 07:20:39,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 07:20:39,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 07:20:39,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 07:20:39,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 07:20:39,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 07:20:39,133 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:39,133 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:39,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:39,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:39,152 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:39,152 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:39,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:39,156 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:39,158 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:39,158 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:39,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:39,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:39,177 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:39,177 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:39,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:39,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:39,195 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:39,195 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:39,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:39,211 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:39,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:39,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:39,680 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:39,681 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:39,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:39,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:39,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:39,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:39,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:39,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:39,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:39,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 07:20:39,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:39,682 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:39,682 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 07:20:39,686 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 07:20:39,687 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 07:20:39,688 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 07:20:39,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:39,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:39,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:39,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:39,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:39,721 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:39,721 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:39,722 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 07:20:39,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:39,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:39,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:39,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:39,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:39,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:39,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:39,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:39,724 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 07:20:39,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:39,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:39,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:39,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:39,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:39,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:39,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:39,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:39,725 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 07:20:39,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:39,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:39,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:39,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:39,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:39,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:39,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:39,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:39,728 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 07:20:39,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:39,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:39,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:39,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:39,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:39,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:39,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:39,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:39,729 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 07:20:39,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:39,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:39,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:39,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:39,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:39,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:39,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:39,732 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:39,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:39,734 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:39,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:39,734 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:39,734 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:39,735 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-10 07:20:39,735 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:39,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:39,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:39,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:20:39,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 07:20:39,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 293 transitions. cyclomatic complexity: 89 Second operand 10 states. [2018-11-10 07:20:40,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 293 transitions. cyclomatic complexity: 89. Second operand 10 states. Result 1106 states and 1518 transitions. Complement of second has 40 states. [2018-11-10 07:20:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 07:20:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-10 07:20:40,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 46 letters. Loop has 26 letters. [2018-11-10 07:20:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:40,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 72 letters. Loop has 26 letters. [2018-11-10 07:20:40,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:40,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 46 letters. Loop has 52 letters. [2018-11-10 07:20:40,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:40,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1106 states and 1518 transitions. [2018-11-10 07:20:40,135 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 73 [2018-11-10 07:20:40,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1106 states to 890 states and 1248 transitions. [2018-11-10 07:20:40,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2018-11-10 07:20:40,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2018-11-10 07:20:40,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 890 states and 1248 transitions. [2018-11-10 07:20:40,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:40,148 INFO L705 BuchiCegarLoop]: Abstraction has 890 states and 1248 transitions. [2018-11-10 07:20:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states and 1248 transitions. [2018-11-10 07:20:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 830. [2018-11-10 07:20:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-11-10 07:20:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1162 transitions. [2018-11-10 07:20:40,180 INFO L728 BuchiCegarLoop]: Abstraction has 830 states and 1162 transitions. [2018-11-10 07:20:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:20:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:20:40,181 INFO L87 Difference]: Start difference. First operand 830 states and 1162 transitions. Second operand 14 states. [2018-11-10 07:20:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:40,366 INFO L93 Difference]: Finished difference Result 823 states and 1146 transitions. [2018-11-10 07:20:40,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 07:20:40,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 823 states and 1146 transitions. [2018-11-10 07:20:40,375 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 73 [2018-11-10 07:20:40,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 823 states to 793 states and 1106 transitions. [2018-11-10 07:20:40,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2018-11-10 07:20:40,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2018-11-10 07:20:40,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 793 states and 1106 transitions. [2018-11-10 07:20:40,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:40,388 INFO L705 BuchiCegarLoop]: Abstraction has 793 states and 1106 transitions. [2018-11-10 07:20:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states and 1106 transitions. [2018-11-10 07:20:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 728. [2018-11-10 07:20:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-11-10 07:20:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1025 transitions. [2018-11-10 07:20:40,411 INFO L728 BuchiCegarLoop]: Abstraction has 728 states and 1025 transitions. [2018-11-10 07:20:40,411 INFO L608 BuchiCegarLoop]: Abstraction has 728 states and 1025 transitions. [2018-11-10 07:20:40,411 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:20:40,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 728 states and 1025 transitions. [2018-11-10 07:20:40,415 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 73 [2018-11-10 07:20:40,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:40,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:40,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:40,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:40,416 INFO L793 eck$LassoCheckResult]: Stem: 6892#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6886#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 := 6; 6850#L37 call main_#t~ret4 := fibo1(main_~x~0);< 6851#fibo1ENTRY ~n := #in~n; 6970#L8 assume !(~n < 1); 6969#L10 assume !(~n == 1); 6965#L13 call #t~ret0 := fibo2(~n - 1);< 6968#fibo2ENTRY ~n := #in~n; 6967#L18 assume !(~n < 1); 6966#L20 assume !(~n == 1); 6939#L23 call #t~ret2 := fibo1(~n - 1);< 6964#fibo1ENTRY ~n := #in~n; 6962#L8 assume !(~n < 1); 6963#L10 assume !(~n == 1); 6931#L13 call #t~ret0 := fibo2(~n - 1);< 6938#fibo2ENTRY ~n := #in~n; 6937#L18 assume !(~n < 1); 6936#L20 assume !(~n == 1); 6883#L23 call #t~ret2 := fibo1(~n - 1);< 6935#fibo1ENTRY ~n := #in~n; 6950#L8 assume !(~n < 1); 6946#L10 assume ~n == 1;#res := 1; 6943#fibo1FINAL assume true; 6944#fibo1EXIT >#46#return; 6921#L23-1 call #t~ret3 := fibo1(~n - 2);< 6932#fibo1ENTRY ~n := #in~n; 6926#L8 assume !(~n < 1); 6927#L10 assume !(~n == 1); 6917#L13 call #t~ret0 := fibo2(~n - 1);< 6923#fibo2ENTRY ~n := #in~n; 6916#L18 assume !(~n < 1); 6918#L20 assume !(~n == 1); 7006#L23 call #t~ret2 := fibo1(~n - 1);< 7187#fibo1ENTRY ~n := #in~n; 7188#L8 assume !(~n < 1); 7176#L10 assume !(~n == 1); 7178#L13 call #t~ret0 := fibo2(~n - 1);< 7197#fibo2ENTRY [2018-11-10 07:20:40,416 INFO L795 eck$LassoCheckResult]: Loop: 7197#fibo2ENTRY ~n := #in~n; 7196#L18 assume !(~n < 1); 7194#L20 assume !(~n == 1); 7183#L23 call #t~ret2 := fibo1(~n - 1);< 7190#fibo1ENTRY ~n := #in~n; 7182#L8 assume !(~n < 1); 7186#L10 assume !(~n == 1); 7189#L13 call #t~ret0 := fibo2(~n - 1);< 7197#fibo2ENTRY [2018-11-10 07:20:40,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash 11031926, now seen corresponding path program 1 times [2018-11-10 07:20:40,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:40,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:20:40,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:40,523 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:40,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:20:40,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:40,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-11-10 07:20:40,647 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:20:40,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:40,648 INFO L82 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2018-11-10 07:20:40,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:40,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:40,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:40,705 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:40,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:40,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:40,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:40,706 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:40,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:40,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:40,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 07:20:40,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:40,706 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:40,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,712 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 07:20:40,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,714 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 07:20:40,715 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 07:20:40,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,717 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 07:20:40,746 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:40,746 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,757 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,758 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,776 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,776 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,795 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,795 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,813 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,813 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,831 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,831 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,850 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,850 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,868 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,868 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,886 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,886 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,904 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:40,904 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:40,921 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:40,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:40,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:40,982 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:40,983 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:40,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:40,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:40,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:40,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:40,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:40,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:40,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:40,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 07:20:40,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:40,984 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,986 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 07:20:40,987 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 07:20:40,988 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 07:20:40,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:40,990 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 07:20:40,991 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 07:20:40,992 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 07:20:40,993 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 07:20:40,996 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 07:20:41,020 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:41,021 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:41,021 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 07:20:41,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,023 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 07:20:41,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,025 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 07:20:41,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,027 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 07:20:41,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,038 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 07:20:41,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:20:41,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,048 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 07:20:41,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,049 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 07:20:41,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:41,050 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 07:20:41,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:41,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:41,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:41,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:41,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:41,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:41,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:41,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:41,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:41,052 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:41,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:41,052 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:41,053 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:41,053 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-10 07:20:41,053 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:41,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:41,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:41,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:41,140 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 07:20:41,140 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 07:20:41,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 728 states and 1025 transitions. cyclomatic complexity: 318 Second operand 7 states. [2018-11-10 07:20:41,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 728 states and 1025 transitions. cyclomatic complexity: 318. Second operand 7 states. Result 852 states and 1156 transitions. Complement of second has 23 states. [2018-11-10 07:20:41,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-10 07:20:41,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-10 07:20:41,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:41,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 45 letters. Loop has 8 letters. [2018-11-10 07:20:41,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:41,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 37 letters. Loop has 16 letters. [2018-11-10 07:20:41,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:41,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 852 states and 1156 transitions. [2018-11-10 07:20:41,234 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 64 [2018-11-10 07:20:41,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 852 states to 776 states and 1074 transitions. [2018-11-10 07:20:41,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2018-11-10 07:20:41,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2018-11-10 07:20:41,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 776 states and 1074 transitions. [2018-11-10 07:20:41,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:41,243 INFO L705 BuchiCegarLoop]: Abstraction has 776 states and 1074 transitions. [2018-11-10 07:20:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states and 1074 transitions. [2018-11-10 07:20:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 767. [2018-11-10 07:20:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-11-10 07:20:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1065 transitions. [2018-11-10 07:20:41,264 INFO L728 BuchiCegarLoop]: Abstraction has 767 states and 1065 transitions. [2018-11-10 07:20:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 07:20:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:20:41,265 INFO L87 Difference]: Start difference. First operand 767 states and 1065 transitions. Second operand 24 states. [2018-11-10 07:20:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:41,620 INFO L93 Difference]: Finished difference Result 309 states and 410 transitions. [2018-11-10 07:20:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 07:20:41,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 410 transitions. [2018-11-10 07:20:41,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 07:20:41,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 291 states and 387 transitions. [2018-11-10 07:20:41,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-10 07:20:41,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2018-11-10 07:20:41,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 387 transitions. [2018-11-10 07:20:41,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:41,627 INFO L705 BuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2018-11-10 07:20:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 387 transitions. [2018-11-10 07:20:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 263. [2018-11-10 07:20:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-10 07:20:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 349 transitions. [2018-11-10 07:20:41,633 INFO L728 BuchiCegarLoop]: Abstraction has 263 states and 349 transitions. [2018-11-10 07:20:41,633 INFO L608 BuchiCegarLoop]: Abstraction has 263 states and 349 transitions. [2018-11-10 07:20:41,633 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:20:41,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 349 transitions. [2018-11-10 07:20:41,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 07:20:41,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:41,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:41,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:41,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:41,635 INFO L793 eck$LassoCheckResult]: Stem: 9869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9864#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 := 6; 9843#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9844#fibo1ENTRY ~n := #in~n; 9873#L8 assume !(~n < 1); 9842#L10 assume !(~n == 1); 9823#L13 call #t~ret0 := fibo2(~n - 1);< 9856#fibo2ENTRY ~n := #in~n; 9871#L18 assume !(~n < 1); 9877#L20 assume !(~n == 1); 9822#L23 call #t~ret2 := fibo1(~n - 1);< 9824#fibo1ENTRY ~n := #in~n; 9929#L8 assume !(~n < 1); 9927#L10 assume !(~n == 1); 9914#L13 call #t~ret0 := fibo2(~n - 1);< 9925#fibo2ENTRY ~n := #in~n; 9923#L18 assume !(~n < 1); 9921#L20 assume !(~n == 1); 9896#L23 call #t~ret2 := fibo1(~n - 1);< 9909#fibo1ENTRY ~n := #in~n; 9910#L8 assume !(~n < 1); 10042#L10 assume !(~n == 1); 10040#L13 call #t~ret0 := fibo2(~n - 1);< 10041#fibo2ENTRY ~n := #in~n; 10049#L18 assume !(~n < 1); 10048#L20 assume ~n == 1;#res := 1; 10045#fibo2FINAL assume true; 10039#fibo2EXIT >#50#return; 10036#L13-1 call #t~ret1 := fibo2(~n - 2);< 10037#fibo2ENTRY ~n := #in~n; 10051#L18 assume ~n < 1;#res := 0; 10050#fibo2FINAL assume true; 10035#fibo2EXIT >#52#return; 10032#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10028#fibo1FINAL assume true; 10026#fibo1EXIT >#46#return; 10023#L23-1 call #t~ret3 := fibo1(~n - 2);< 10025#fibo1ENTRY ~n := #in~n; 10038#L8 assume !(~n < 1); 10033#L10 assume ~n == 1;#res := 1; 10029#fibo1FINAL assume true; 10022#fibo1EXIT >#48#return; 9992#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10058#fibo2FINAL assume true; 9970#fibo2EXIT >#50#return; 9964#L13-1 call #t~ret1 := fibo2(~n - 2);< 9968#fibo2ENTRY [2018-11-10 07:20:41,635 INFO L795 eck$LassoCheckResult]: Loop: 9968#fibo2ENTRY ~n := #in~n; 9996#L18 assume !(~n < 1); 9994#L20 assume !(~n == 1); 9951#L23 call #t~ret2 := fibo1(~n - 1);< 9958#fibo1ENTRY ~n := #in~n; 9978#L8 assume !(~n < 1); 9975#L10 assume !(~n == 1); 9965#L13 call #t~ret0 := fibo2(~n - 1);< 9968#fibo2ENTRY [2018-11-10 07:20:41,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash -177678082, now seen corresponding path program 3 times [2018-11-10 07:20:41,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:41,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:41,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 3 times [2018-11-10 07:20:41,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:41,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:41,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:41,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:41,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1358906085, now seen corresponding path program 4 times [2018-11-10 07:20:41,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:41,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:20:41,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:41,723 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:20:41,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:20:41,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:20:41,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:20:41,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:20:41,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 07:20:41,821 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:41,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:41,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:41,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:41,822 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:41,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:41,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:41,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:41,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 07:20:41,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:41,822 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:41,823 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 07:20:41,827 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 07:20:41,828 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 07:20:41,829 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 07:20:41,831 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 07:20:41,832 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 07:20:41,837 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 07:20:41,839 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 07:20:41,840 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 07:20:41,842 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 07:20:41,870 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:41,870 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:41,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:41,878 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:41,878 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:41,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:41,901 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:41,902 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_6019441a-86b1-4bb8-badf-2640ec3df873/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 07:20:41,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:41,922 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:41,922 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:41,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:41,946 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:41,946 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:41,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:41,974 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:41,974 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:41,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:41,999 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:42,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:42,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:42,064 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:42,065 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:42,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:42,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:42,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:42,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:42,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:42,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:42,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:42,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 07:20:42,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:42,065 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:42,066 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 07:20:42,067 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 07:20:42,068 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 07:20:42,069 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 07:20:42,070 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 07:20:42,073 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 07:20:42,078 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 07:20:42,079 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 07:20:42,084 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 07:20:42,090 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 07:20:42,118 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:42,118 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:42,118 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 07:20:42,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,120 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 07:20:42,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,121 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 07:20:42,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,124 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 07:20:42,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,126 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 07:20:42,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,127 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 07:20:42,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,129 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 07:20:42,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:42,134 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 07:20:42,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:42,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:42,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:42,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:42,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:42,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:42,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:42,136 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:42,137 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:42,137 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:42,139 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:42,139 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:42,139 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:42,139 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2018-11-10 07:20:42,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:42,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,266 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 07:20:42,266 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 07:20:42,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-10 07:20:42,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 423 states and 540 transitions. Complement of second has 26 states. [2018-11-10 07:20:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-10 07:20:42,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 46 letters. Loop has 8 letters. [2018-11-10 07:20:42,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:42,376 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:20:42,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,464 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 07:20:42,464 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 07:20:42,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-10 07:20:42,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 423 states and 540 transitions. Complement of second has 26 states. [2018-11-10 07:20:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-10 07:20:42,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 46 letters. Loop has 8 letters. [2018-11-10 07:20:42,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:42,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:20:42,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:42,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:42,651 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 07:20:42,652 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 07:20:42,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-10 07:20:42,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 349 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 495 states and 641 transitions. Complement of second has 25 states. [2018-11-10 07:20:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-10 07:20:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 46 letters. Loop has 8 letters. [2018-11-10 07:20:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 54 letters. Loop has 8 letters. [2018-11-10 07:20:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 46 letters. Loop has 16 letters. [2018-11-10 07:20:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:42,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 641 transitions. [2018-11-10 07:20:42,776 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2018-11-10 07:20:42,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 380 states and 503 transitions. [2018-11-10 07:20:42,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-11-10 07:20:42,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-10 07:20:42,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 380 states and 503 transitions. [2018-11-10 07:20:42,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:42,779 INFO L705 BuchiCegarLoop]: Abstraction has 380 states and 503 transitions. [2018-11-10 07:20:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states and 503 transitions. [2018-11-10 07:20:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 353. [2018-11-10 07:20:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-10 07:20:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 455 transitions. [2018-11-10 07:20:42,786 INFO L728 BuchiCegarLoop]: Abstraction has 353 states and 455 transitions. [2018-11-10 07:20:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:20:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:20:42,786 INFO L87 Difference]: Start difference. First operand 353 states and 455 transitions. Second operand 14 states. [2018-11-10 07:20:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:42,931 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2018-11-10 07:20:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:20:42,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 301 transitions. [2018-11-10 07:20:42,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 07:20:42,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 208 states and 253 transitions. [2018-11-10 07:20:42,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-11-10 07:20:42,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2018-11-10 07:20:42,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 253 transitions. [2018-11-10 07:20:42,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:20:42,937 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-11-10 07:20:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 253 transitions. [2018-11-10 07:20:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2018-11-10 07:20:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 07:20:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2018-11-10 07:20:42,941 INFO L728 BuchiCegarLoop]: Abstraction has 192 states and 230 transitions. [2018-11-10 07:20:42,941 INFO L608 BuchiCegarLoop]: Abstraction has 192 states and 230 transitions. [2018-11-10 07:20:42,941 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:20:42,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 230 transitions. [2018-11-10 07:20:42,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 07:20:42,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:20:42,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:20:42,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:42,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:20:42,943 INFO L793 eck$LassoCheckResult]: Stem: 12868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12867#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 := 6; 12842#L37 call main_#t~ret4 := fibo1(main_~x~0);< 12843#fibo1ENTRY ~n := #in~n; 12909#L8 assume !(~n < 1); 12910#L10 assume !(~n == 1); 12856#L13 call #t~ret0 := fibo2(~n - 1);< 12857#fibo2ENTRY ~n := #in~n; 12913#L18 assume !(~n < 1); 12912#L20 assume !(~n == 1); 12847#L23 call #t~ret2 := fibo1(~n - 1);< 12870#fibo1ENTRY ~n := #in~n; 12871#L8 assume !(~n < 1); 12846#L10 assume !(~n == 1); 12848#L13 call #t~ret0 := fibo2(~n - 1);< 12902#fibo2ENTRY ~n := #in~n; 12899#L18 assume !(~n < 1); 12900#L20 assume !(~n == 1); 12854#L23 call #t~ret2 := fibo1(~n - 1);< 12887#fibo1ENTRY ~n := #in~n; 12889#L8 assume !(~n < 1); 12907#L10 assume !(~n == 1); 12852#L13 call #t~ret0 := fibo2(~n - 1);< 12855#fibo2ENTRY ~n := #in~n; 12993#L18 assume !(~n < 1); 12991#L20 assume ~n == 1;#res := 1; 12990#fibo2FINAL assume true; 12989#fibo2EXIT >#50#return; 12858#L13-1 call #t~ret1 := fibo2(~n - 2);< 12859#fibo2ENTRY ~n := #in~n; 13003#L18 assume ~n < 1;#res := 0; 13001#fibo2FINAL assume true; 13000#fibo2EXIT >#52#return; 12998#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 12997#fibo1FINAL assume true; 12996#fibo1EXIT >#46#return; 12931#L23-1 call #t~ret3 := fibo1(~n - 2);< 12934#fibo1ENTRY ~n := #in~n; 13007#L8 assume !(~n < 1); 13006#L10 assume ~n == 1;#res := 1; 12994#fibo1FINAL assume true; 12930#fibo1EXIT >#48#return; 12929#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12927#fibo2FINAL assume true; 12926#fibo2EXIT >#50#return; 12831#L13-1 call #t~ret1 := fibo2(~n - 2);< 12925#fibo2ENTRY ~n := #in~n; 13004#L18 assume !(~n < 1); 13002#L20 assume !(~n == 1); 12830#L23 call #t~ret2 := fibo1(~n - 1);< 12833#fibo1ENTRY ~n := #in~n; 12869#L8 assume !(~n < 1); 12844#L10 assume ~n == 1;#res := 1; 12845#fibo1FINAL assume true; 12860#fibo1EXIT >#46#return; 12838#L23-1 call #t~ret3 := fibo1(~n - 2);< 12839#fibo1ENTRY ~n := #in~n; 13020#L8 assume ~n < 1;#res := 0; 13017#fibo1FINAL assume true; 12851#fibo1EXIT >#48#return; 12849#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 12850#fibo2FINAL assume true; 12924#fibo2EXIT >#52#return; 12923#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 12922#fibo1FINAL assume true; 12921#fibo1EXIT >#46#return; 12865#L23-1 call #t~ret3 := fibo1(~n - 2);< 12890#fibo1ENTRY [2018-11-10 07:20:42,943 INFO L795 eck$LassoCheckResult]: Loop: 12890#fibo1ENTRY ~n := #in~n; 12891#L8 assume !(~n < 1); 12879#L10 assume !(~n == 1); 12881#L13 call #t~ret0 := fibo2(~n - 1);< 12903#fibo2ENTRY ~n := #in~n; 12904#L18 assume !(~n < 1); 12959#L20 assume !(~n == 1); 12864#L23 call #t~ret2 := fibo1(~n - 1);< 12890#fibo1ENTRY [2018-11-10 07:20:42,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash 944778444, now seen corresponding path program 1 times [2018-11-10 07:20:42,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:42,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:42,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:42,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:42,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 4 times [2018-11-10 07:20:42,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:42,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:42,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1215722803, now seen corresponding path program 2 times [2018-11-10 07:20:42,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:42,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:42,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:20:42,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:20:43,037 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:43,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:43,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:43,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:43,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:20:43,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:43,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:43,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration10_Loop [2018-11-10 07:20:43,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:43,038 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:43,038 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 07:20:43,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 07:20:43,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:43,050 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 07:20:43,052 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 07:20:43,053 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 07:20:43,057 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 07:20:43,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:20:43,059 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 07:20:43,061 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 07:20:43,085 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:43,085 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,091 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:43,091 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,119 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:43,119 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,138 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:43,138 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,155 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:43,155 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,173 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:20:43,173 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_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:20:43,190 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6019441a-86b1-4bb8-badf-2640ec3df873/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:20:43,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:20:43,260 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:20:43,261 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:20:43,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:20:43,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:20:43,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:20:43,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:20:43,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:20:43,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:20:43,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:20:43,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_false-unreach-call_true-termination.c_Iteration10_Loop [2018-11-10 07:20:43,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:20:43,262 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:20:43,262 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 07:20:43,263 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 07:20:43,264 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 07:20:43,265 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 07:20:43,266 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 07:20:43,267 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 07:20:43,270 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 07:20:43,271 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 07:20:43,272 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 07:20:43,272 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 07:20:43,301 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:20:43,301 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:20:43,301 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 07:20:43,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:43,303 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 07:20:43,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:43,304 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 07:20:43,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:43,306 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 07:20:43,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:43,308 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 07:20:43,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:20:43,309 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 07:20:43,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:20:43,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:20:43,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:20:43,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:20:43,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:20:43,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:20:43,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:20:43,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:20:43,312 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:20:43,313 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:20:43,313 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:20:43,313 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:20:43,313 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:20:43,313 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-10 07:20:43,313 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:20:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,492 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 07:20:43,492 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 07:20:43,492 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42 Second operand 7 states. [2018-11-10 07:20:43,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42. Second operand 7 states. Result 200 states and 239 transitions. Complement of second has 7 states. [2018-11-10 07:20:43,529 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 07:20:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 07:20:43,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 67 letters. Loop has 8 letters. [2018-11-10 07:20:43,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:43,530 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:20:43,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,608 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 07:20:43,608 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 07:20:43,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42 Second operand 7 states. [2018-11-10 07:20:43,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42. Second operand 7 states. Result 200 states and 239 transitions. Complement of second has 7 states. [2018-11-10 07:20:43,643 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 07:20:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 07:20:43,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 67 letters. Loop has 8 letters. [2018-11-10 07:20:43,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:43,644 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:20:43,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:43,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:43,723 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 07:20:43,723 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 07:20:43,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42 Second operand 7 states. [2018-11-10 07:20:43,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 230 transitions. cyclomatic complexity: 42. Second operand 7 states. Result 266 states and 322 transitions. Complement of second has 23 states. [2018-11-10 07:20:43,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 07:20:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:20:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-10 07:20:43,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 67 letters. Loop has 8 letters. [2018-11-10 07:20:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 75 letters. Loop has 8 letters. [2018-11-10 07:20:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 67 letters. Loop has 16 letters. [2018-11-10 07:20:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:20:43,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 322 transitions. [2018-11-10 07:20:43,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:20:43,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:20:43,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:20:43,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:20:43,838 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:20:43,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:20:43,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:20:43,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:20:43,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:20:43 BoogieIcfgContainer [2018-11-10 07:20:43,842 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:20:43,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:20:43,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:20:43,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:20:43,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:34" (3/4) ... [2018-11-10 07:20:43,846 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:20:43,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:20:43,847 INFO L168 Benchmark]: Toolchain (without parser) took 9758.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.5 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -47.3 MB). Peak memory consumption was 330.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,848 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:20:43,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.68 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:20:43,848 INFO L168 Benchmark]: Boogie Preprocessor took 9.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,849 INFO L168 Benchmark]: RCFGBuilder took 184.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,849 INFO L168 Benchmark]: BuchiAutomizer took 9373.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 142.9 MB). Peak memory consumption was 362.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,850 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:20:43,852 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.68 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9373.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 142.9 MB). Peak memory consumption was 362.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.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 (8 trivial, 4 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 deterministic module has affine ranking function n and consists of 12 locations. One deterministic module has affine ranking function \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 5.4s. Construction of modules took 1.1s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 299 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 728 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/16 HoareTripleCheckerStatistics: 398 SDtfs, 870 SDslu, 1056 SDs, 0 SdLazy, 2173 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf93 smp76 dnf100 smp100 tf111 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 34 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 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...