./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:35:57,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:35:57,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:35:57,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:35:57,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:35:57,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:35:57,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:35:57,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:35:57,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:35:57,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:35:57,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:35:57,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:35:57,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:35:57,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:35:57,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:35:57,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:35:57,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:35:57,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:35:57,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:35:57,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:35:57,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:35:57,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:35:57,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:35:57,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:35:57,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:35:57,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:35:57,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:35:57,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:35:57,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:35:57,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:35:57,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:35:57,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:35:57,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:35:57,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:35:57,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:35:57,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:35:57,992 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:35:58,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:35:58,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:35:58,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:35:58,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:35:58,003 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:35:58,003 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:35:58,003 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:35:58,003 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:35:58,003 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:35:58,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:35:58,004 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:35:58,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:35:58,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:35:58,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:35:58,006 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:35:58,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:35:58,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:35:58,006 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:35:58,007 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:35:58,007 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_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-10 05:35:58,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:35:58,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:35:58,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:35:58,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:35:58,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:35:58,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-10 05:35:58,076 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/data/31bfdbbf4/7a94ace650ba4f509608df072c56edfe/FLAG7bc94b980 [2018-11-10 05:35:58,382 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:35:58,382 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-10 05:35:58,386 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/data/31bfdbbf4/7a94ace650ba4f509608df072c56edfe/FLAG7bc94b980 [2018-11-10 05:35:58,395 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/data/31bfdbbf4/7a94ace650ba4f509608df072c56edfe [2018-11-10 05:35:58,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:35:58,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:35:58,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:35:58,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:35:58,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:35:58,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31137421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58, skipping insertion in model container [2018-11-10 05:35:58,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:35:58,429 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:35:58,532 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:35:58,534 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:35:58,542 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:35:58,550 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:35:58,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58 WrapperNode [2018-11-10 05:35:58,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:35:58,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:35:58,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:35:58,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:35:58,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:35:58,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:35:58,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:35:58,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:35:58,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... [2018-11-10 05:35:58,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:35:58,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:35:58,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:35:58,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:35:58,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:35:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:35:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-10 05:35:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-10 05:35:58,726 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:35:58,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:58 BoogieIcfgContainer [2018-11-10 05:35:58,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:35:58,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:35:58,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:35:58,729 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:35:58,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:58,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:35:58" (1/3) ... [2018-11-10 05:35:58,730 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11d152d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:35:58, skipping insertion in model container [2018-11-10 05:35:58,730 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:58,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:58" (2/3) ... [2018-11-10 05:35:58,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11d152d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:35:58, skipping insertion in model container [2018-11-10 05:35:58,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:58,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:58" (3/3) ... [2018-11-10 05:35:58,732 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-10 05:35:58,767 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:35:58,767 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:35:58,767 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:35:58,767 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:35:58,768 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:35:58,768 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:35:58,768 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:35:58,768 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:35:58,768 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:35:58,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 05:35:58,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:58,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:58,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:58,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 05:35:58,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:35:58,800 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:35:58,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 05:35:58,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:58,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:58,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:58,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 05:35:58,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:35:58,807 INFO L793 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-11-10 05:35:58,807 INFO L795 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(~n == 1); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-10 05:35:58,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-10 05:35:58,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:58,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:58,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-10 05:35:58,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-10 05:35:58,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:58,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:58,951 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:35:58,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:35:58,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:35:58,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:35:58,952 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:35:58,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:58,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:35:58,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:35:58,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 05:35:58,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:35:58,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:35:58,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:58,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:58,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:58,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 05:35:58,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,126 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:35:59,127 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:35:59,144 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:35:59,144 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:35:59,163 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:35:59,163 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:35:59,181 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:35:59,181 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,197 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:35:59,199 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:35:59,199 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,214 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:35:59,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:35:59,250 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:35:59,251 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:35:59,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:35:59,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:35:59,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:35:59,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:35:59,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:59,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:35:59,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:35:59,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 05:35:59,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:35:59,252 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:35:59,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,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 05:35:59,313 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:35:59,317 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:35:59,318 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 05:35:59,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:59,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:59,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:59,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:59,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:59,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:59,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:59,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:59,325 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 05:35:59,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:59,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:59,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:59,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:59,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:59,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:59,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:59,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:59,328 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 05:35:59,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:59,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:59,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:59,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:59,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:59,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:59,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:59,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:59,331 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 05:35:59,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:59,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:59,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:59,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:59,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:59,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:59,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:59,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:59,335 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 05:35:59,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:59,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:59,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:59,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:59,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:59,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:59,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:59,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:35:59,345 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:35:59,346 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:35:59,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:35:59,347 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:35:59,348 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:35:59,348 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 05:35:59,349 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:35:59,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:59,453 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 05:35:59,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:35:59,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 05:35:59,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-11-10 05:35:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:35:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:35:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 05:35:59,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-10 05:35:59,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:59,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 05:35:59,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:59,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 05:35:59,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:59,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-10 05:35:59,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:59,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-10 05:35:59,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:35:59,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 05:35:59,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-10 05:35:59,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:35:59,554 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-10 05:35:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-10 05:35:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-10 05:35:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 05:35:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-10 05:35:59,574 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 05:35:59,574 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 05:35:59,575 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:35:59,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-10 05:35:59,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:59,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:59,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:59,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:59,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:59,576 INFO L793 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(~n == 1); 123#L11 call #t~ret0 := fibo(~n - 1);< 133#fiboENTRY ~n := #in~n; 134#L6 assume ~n < 1;#res := 0; 129#fiboFINAL assume true; 122#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 05:35:59,576 INFO L795 eck$LassoCheckResult]: Loop: 124#L11-1 call #t~ret1 := fibo(~n - 2);< 138#fiboENTRY ~n := #in~n; 141#L6 assume !(~n < 1); 140#L8 assume !(~n == 1); 136#L11 call #t~ret0 := fibo(~n - 1);< 138#fiboENTRY ~n := #in~n; 141#L6 assume ~n < 1;#res := 0; 137#fiboFINAL assume true; 139#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 05:35:59,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-10 05:35:59,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,624 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 05:35:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:35:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:35:59,627 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:35:59,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-10 05:35:59,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,669 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 05:35:59,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:35:59,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:35:59,670 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:35:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:35:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:35:59,673 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 05:35:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:59,748 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-10 05:35:59,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:35:59,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-10 05:35:59,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:59,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-10 05:35:59,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 05:35:59,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 05:35:59,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-10 05:35:59,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:35:59,751 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 05:35:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-10 05:35:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 05:35:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 05:35:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-10 05:35:59,754 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 05:35:59,754 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 05:35:59,754 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:35:59,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-10 05:35:59,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:35:59,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:59,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:59,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:59,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:59,755 INFO L793 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(~n == 1); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume ~n == 1;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 05:35:59,755 INFO L795 eck$LassoCheckResult]: Loop: 189#L11-1 call #t~ret1 := fibo(~n - 2);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume !(~n == 1); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume ~n == 1;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 05:35:59,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-10 05:35:59,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:59,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:59,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:35:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:59,812 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:35:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:59,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:59,836 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 05:35:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:35:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 05:35:59,860 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:35:59,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-10 05:35:59,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:59,939 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:35:59,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:35:59,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:35:59,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:35:59,939 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:35:59,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:59,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:35:59,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:35:59,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 05:35:59,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:35:59,940 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:35:59,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:59,977 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:35:59,978 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:35:59,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:35:59,984 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:00,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:00,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:00,903 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:00,904 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:00,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:00,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:00,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:00,904 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:00,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:00,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:00,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:00,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 05:36:00,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:00,904 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:00,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:00,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:00,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:00,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:00,946 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:00,946 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:00,946 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 05:36:00,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:00,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:00,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:00,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:00,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:00,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:00,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:00,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:00,953 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 05:36:00,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:00,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:00,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:00,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:00,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:00,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:00,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:00,960 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:00,964 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:00,964 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:00,964 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:00,964 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:00,965 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:00,965 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:00,965 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:00,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:00,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:01,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:01,060 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 05:36:01,061 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 05:36:01,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 05:36:01,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-10 05:36:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:36:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 05:36:01,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 05:36:01,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:01,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-10 05:36:01,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:01,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-10 05:36:01,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:01,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-10 05:36:01,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:36:01,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-10 05:36:01,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 05:36:01,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 05:36:01,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-10 05:36:01,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:01,170 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-10 05:36:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-10 05:36:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-10 05:36:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 05:36:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-10 05:36:01,178 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-10 05:36:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:36:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:36:01,178 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-10 05:36:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:01,235 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-10 05:36:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:36:01,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-10 05:36:01,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:36:01,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-10 05:36:01,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 05:36:01,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 05:36:01,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-10 05:36:01,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:01,242 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-10 05:36:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-10 05:36:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-10 05:36:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 05:36:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-10 05:36:01,251 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 05:36:01,251 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 05:36:01,251 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:36:01,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-10 05:36:01,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:36:01,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:01,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:01,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:36:01,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:36:01,254 INFO L793 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(~n == 1); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume ~n == 1;#res := 1; 773#fiboFINAL assume true; 772#fiboEXIT >#33#return; 729#L11-1 call #t~ret1 := fibo(~n - 2);< 771#fiboENTRY ~n := #in~n; 801#L6 assume ~n < 1;#res := 0; 800#fiboFINAL assume true; 799#fiboEXIT >#35#return; 798#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 05:36:01,255 INFO L795 eck$LassoCheckResult]: Loop: 723#L11-1 call #t~ret1 := fibo(~n - 2);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume !(~n == 1); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume ~n == 1;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 05:36:01,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-10 05:36:01,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:01,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:01,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:01,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:36:01,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:36:01,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:01,304 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:36:01,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:36:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:01,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:36:01,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:01,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 05:36:01,347 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:36:01,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-10 05:36:01,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:01,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:01,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:01,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:36:01,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:01,414 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:01,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:01,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:01,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:01,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:01,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:01,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:01,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:01,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 05:36:01,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:01,415 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:01,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:01,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:01,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:01,444 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:01,444 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:01,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:01,446 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:01,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:01,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:02,361 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:02,363 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:02,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:02,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:02,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:02,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:02,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:02,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:02,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:02,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 05:36:02,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:02,363 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:02,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:02,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:02,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:02,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:02,421 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:02,422 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:02,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:36:02,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:02,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:02,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:02,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:02,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:02,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:02,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:02,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:02,425 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 05:36:02,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:02,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:02,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:02,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:02,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:02,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:02,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:02,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:02,427 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 05:36:02,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:02,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:02,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:02,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:02,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:02,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:02,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:02,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:02,430 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 05:36:02,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:02,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:02,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:02,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:02,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:02,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:02,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:02,438 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:02,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:02,440 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:02,441 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:02,441 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:02,441 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:02,441 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:02,441 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:02,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:02,524 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 05:36:02,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 05:36:02,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-10 05:36:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:36:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 05:36:02,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 05:36:02,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:02,618 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:02,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,693 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 05:36:02,694 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 05:36:02,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 05:36:02,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-10 05:36:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:36:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 05:36:02,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 05:36:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:02,803 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:02,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:02,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:02,876 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 05:36:02,877 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 05:36:02,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 05:36:02,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-10 05:36:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:36:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-10 05:36:02,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 05:36:02,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:02,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-10 05:36:02,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:02,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-10 05:36:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:02,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-10 05:36:03,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 05:36:03,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-10 05:36:03,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 05:36:03,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-10 05:36:03,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-10 05:36:03,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:03,013 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-10 05:36:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-10 05:36:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-10 05:36:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-10 05:36:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-10 05:36:03,039 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-10 05:36:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:36:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:36:03,039 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-10 05:36:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:03,179 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-10 05:36:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:36:03,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-10 05:36:03,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 05:36:03,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-10 05:36:03,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-10 05:36:03,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-10 05:36:03,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-10 05:36:03,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:03,197 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-10 05:36:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-10 05:36:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-10 05:36:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-10 05:36:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-10 05:36:03,217 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 05:36:03,217 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 05:36:03,217 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:36:03,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-10 05:36:03,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 05:36:03,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:03,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:03,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:36:03,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:36:03,220 INFO L793 eck$LassoCheckResult]: Stem: 3582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3581#L25 call main_#t~ret2 := fibo(main_~x~0);< 3622#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3633#L8 assume !(~n == 1); 3629#L11 call #t~ret0 := fibo(~n - 1);< 3631#fiboENTRY ~n := #in~n; 3632#L6 assume !(~n < 1); 3628#L8 assume !(~n == 1); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3627#L6 assume !(~n < 1); 3630#L8 assume !(~n == 1); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3626#L6 assume !(~n < 1); 3583#L8 assume ~n == 1;#res := 1; 3586#fiboFINAL assume true; 3676#fiboEXIT >#33#return; 3652#L11-1 call #t~ret1 := fibo(~n - 2);< 3661#fiboENTRY ~n := #in~n; 3720#L6 assume !(~n < 1); 3712#L8 assume !(~n == 1); 3714#L11 call #t~ret0 := fibo(~n - 1);< 3913#fiboENTRY ~n := #in~n; 3918#L6 assume !(~n < 1); 3915#L8 assume !(~n == 1); 3916#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-10 05:36:03,220 INFO L795 eck$LassoCheckResult]: Loop: 3925#fiboENTRY ~n := #in~n; 3932#L6 assume !(~n < 1); 3931#L8 assume !(~n == 1); 3922#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-10 05:36:03,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-10 05:36:03,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:03,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 05:36:03,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:03,254 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:36:03,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:36:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-10 05:36:03,355 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:36:03,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-10 05:36:03,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:36:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:03,377 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:03,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:03,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:03,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:03,377 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:03,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:03,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:03,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:03,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 05:36:03,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:03,378 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:03,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,400 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:03,400 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:03,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:03,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:03,407 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:36:03,407 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:03,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:03,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:03,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:03,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:03,459 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:03,460 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:03,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:03,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:03,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:03,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:03,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:03,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:03,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:03,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 05:36:03,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:03,461 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:03,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:03,494 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:03,494 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:03,494 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 05:36:03,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:03,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:03,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:03,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:03,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:03,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:03,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:03,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:03,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:03,498 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:03,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:03,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:03,499 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:03,499 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 05:36:03,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:03,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,560 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 05:36:03,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 05:36:03,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 05:36:03,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-10 05:36:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:36:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 05:36:03,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 05:36:03,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:03,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:03,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,686 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 05:36:03,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 05:36:03,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 05:36:03,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-10 05:36:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:36:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 05:36:03,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 05:36:03,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:03,729 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:03,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:03,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:03,794 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 05:36:03,794 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 05:36:03,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 05:36:03,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-11-10 05:36:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:36:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 05:36:03,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 05:36:03,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:03,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 05:36:03,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:03,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 05:36:03,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:03,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-10 05:36:03,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 05:36:03,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-10 05:36:03,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-10 05:36:03,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-10 05:36:03,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-10 05:36:03,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:03,859 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-10 05:36:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-10 05:36:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-10 05:36:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-10 05:36:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-10 05:36:03,869 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-10 05:36:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:36:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:36:03,870 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-10 05:36:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:04,032 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-10 05:36:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:36:04,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-10 05:36:04,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:04,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-10 05:36:04,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-10 05:36:04,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-10 05:36:04,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-10 05:36:04,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:04,037 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-10 05:36:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-10 05:36:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-10 05:36:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 05:36:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 05:36:04,042 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 05:36:04,042 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 05:36:04,042 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:36:04,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-10 05:36:04,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:04,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:04,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:04,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:36:04,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:36:04,043 INFO L793 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6357#L25 call main_#t~ret2 := fibo(main_~x~0);< 6395#fiboENTRY ~n := #in~n; 6465#L6 assume !(~n < 1); 6464#L8 assume !(~n == 1); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(~n == 1); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(~n == 1); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume ~n == 1;#res := 1; 6550#fiboFINAL assume true; 6549#fiboEXIT >#33#return; 6351#L11-1 call #t~ret1 := fibo(~n - 2);< 6385#fiboENTRY ~n := #in~n; 6553#L6 assume ~n < 1;#res := 0; 6552#fiboFINAL assume true; 6350#fiboEXIT >#35#return; 6352#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6538#fiboFINAL assume true; 6523#fiboEXIT >#33#return; 6374#L11-1 call #t~ret1 := fibo(~n - 2);< 6522#fiboENTRY ~n := #in~n; 6541#L6 assume !(~n < 1); 6396#L8 assume !(~n == 1); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(~n == 1); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 05:36:04,043 INFO L795 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 05:36:04,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-11-10 05:36:04,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:04,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:04,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 05:36:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:04,105 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:36:04,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:36:04,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:36:04,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 05:36:04,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:04,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-10 05:36:04,268 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:36:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-11-10 05:36:04,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:04,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:04,295 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:04,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:04,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:04,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:04,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:04,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:04,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:04,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:04,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 05:36:04,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:04,296 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:04,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:04,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:04,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:04,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:04,329 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:04,329 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:04,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:04,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:04,341 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:36:04,341 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:04,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:04,360 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:04,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:04,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:06,648 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:06,649 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:06,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:06,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:06,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:06,650 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:06,650 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:06,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:06,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:06,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 05:36:06,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:06,650 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:06,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:06,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:06,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:06,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:06,685 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:06,685 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:06,685 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 05:36:06,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:06,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:06,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:06,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:06,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:06,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:06,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:06,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:06,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:06,694 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:06,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:06,694 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:06,695 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:06,695 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:06,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:06,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:06,778 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 05:36:06,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:06,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 05:36:06,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-11-10 05:36:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 05:36:06,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 05:36:06,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:06,814 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:06,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:06,892 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 05:36:06,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:06,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 05:36:06,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-11-10 05:36:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:36:06,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 05:36:06,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:06,943 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:06,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:06,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:07,018 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 05:36:07,018 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:07,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 05:36:07,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-11-10 05:36:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:36:07,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 05:36:07,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:07,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-10 05:36:07,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:07,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-10 05:36:07,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:07,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-10 05:36:07,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:07,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-10 05:36:07,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 05:36:07,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 05:36:07,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-10 05:36:07,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:07,067 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-10 05:36:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-10 05:36:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-10 05:36:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 05:36:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 05:36:07,071 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 05:36:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 05:36:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:36:07,071 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-10 05:36:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:07,297 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-11-10 05:36:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 05:36:07,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-11-10 05:36:07,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:07,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-11-10 05:36:07,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-10 05:36:07,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 05:36:07,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-11-10 05:36:07,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:07,303 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-11-10 05:36:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-11-10 05:36:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-11-10 05:36:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 05:36:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-10 05:36:07,311 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 05:36:07,311 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 05:36:07,311 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:36:07,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-11-10 05:36:07,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:07,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:07,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:07,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 05:36:07,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:36:07,314 INFO L793 eck$LassoCheckResult]: Stem: 8578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8567#L25 call main_#t~ret2 := fibo(main_~x~0);< 8615#fiboENTRY ~n := #in~n; 8682#L6 assume !(~n < 1); 8680#L8 assume !(~n == 1); 8677#L11 call #t~ret0 := fibo(~n - 1);< 8678#fiboENTRY ~n := #in~n; 8694#L6 assume !(~n < 1); 8692#L8 assume !(~n == 1); 8688#L11 call #t~ret0 := fibo(~n - 1);< 8691#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8717#L8 assume !(~n == 1); 8684#L11 call #t~ret0 := fibo(~n - 1);< 8689#fiboENTRY ~n := #in~n; 8708#L6 assume !(~n < 1); 8706#L8 assume !(~n == 1); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8749#L6 assume !(~n < 1); 8830#L8 assume ~n == 1;#res := 1; 8825#fiboFINAL assume true; 8824#fiboEXIT >#33#return; 8607#L11-1 call #t~ret1 := fibo(~n - 2);< 8610#fiboENTRY ~n := #in~n; 8781#L6 assume ~n < 1;#res := 0; 8780#fiboFINAL assume true; 8779#fiboEXIT >#35#return; 8777#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8776#fiboFINAL assume true; 8773#fiboEXIT >#33#return; 8729#L11-1 call #t~ret1 := fibo(~n - 2);< 8732#fiboENTRY ~n := #in~n; 8760#L6 assume !(~n < 1); 8754#L8 assume ~n == 1;#res := 1; 8753#fiboFINAL assume true; 8728#fiboEXIT >#35#return; 8726#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8724#fiboFINAL assume true; 8723#fiboEXIT >#33#return; 8697#L11-1 call #t~ret1 := fibo(~n - 2);< 8700#fiboENTRY ~n := #in~n; 8757#L6 assume !(~n < 1); 8755#L8 assume !(~n == 1); 8570#L11 call #t~ret0 := fibo(~n - 1);< 8612#fiboENTRY ~n := #in~n; 8834#L6 assume !(~n < 1); 8581#L8 assume !(~n == 1); 8582#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-11-10 05:36:07,314 INFO L795 eck$LassoCheckResult]: Loop: 8636#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-11-10 05:36:07,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-11-10 05:36:07,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:07,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:07,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 05:36:07,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:07,383 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:36:07,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 05:36:07,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:36:07,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 05:36:07,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:07,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 05:36:07,426 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:36:07,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-11-10 05:36:07,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:07,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:07,455 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:07,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:07,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:07,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:07,456 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:07,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:07,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:07,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:07,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 05:36:07,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:07,456 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:07,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:07,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:07,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:07,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:07,488 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:07,489 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:07,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:07,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:07,493 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:36:07,493 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:07,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:07,510 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:07,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:07,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:08,525 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:08,526 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:08,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:08,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:08,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:08,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:08,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:08,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:08,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:08,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 05:36:08,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:08,527 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:08,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:08,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:08,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:08,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:08,560 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:08,560 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:08,561 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 05:36:08,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:08,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:08,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:08,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:08,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:08,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:08,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:08,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:08,563 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 05:36:08,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:08,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:08,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:08,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:08,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:08,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:08,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:08,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:08,567 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:08,568 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:08,568 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:08,568 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:08,568 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:08,568 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:08,568 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:08,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,671 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 05:36:08,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:08,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 05:36:08,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 298 states and 400 transitions. Complement of second has 18 states. [2018-11-10 05:36:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 05:36:08,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 05:36:08,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:08,705 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:08,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,785 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 05:36:08,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:08,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 05:36:08,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 304 states and 406 transitions. Complement of second has 17 states. [2018-11-10 05:36:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:36:08,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 05:36:08,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:08,835 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:08,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:08,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:08,922 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 05:36:08,922 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:08,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 05:36:08,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 362 states and 482 transitions. Complement of second has 27 states. [2018-11-10 05:36:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:36:08,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 05:36:08,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:08,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-10 05:36:08,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:08,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 05:36:08,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:08,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-11-10 05:36:08,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:08,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-11-10 05:36:08,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 05:36:08,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-10 05:36:08,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-11-10 05:36:08,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:08,967 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-11-10 05:36:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-11-10 05:36:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-11-10 05:36:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 05:36:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-10 05:36:08,974 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 05:36:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:36:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:36:08,974 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 11 states. [2018-11-10 05:36:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:09,067 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2018-11-10 05:36:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:36:09,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 574 transitions. [2018-11-10 05:36:09,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:09,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 378 states and 548 transitions. [2018-11-10 05:36:09,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-10 05:36:09,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-11-10 05:36:09,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 548 transitions. [2018-11-10 05:36:09,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:09,074 INFO L705 BuchiCegarLoop]: Abstraction has 378 states and 548 transitions. [2018-11-10 05:36:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 548 transitions. [2018-11-10 05:36:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 321. [2018-11-10 05:36:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-10 05:36:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-10 05:36:09,082 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 05:36:09,082 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 05:36:09,082 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:36:09,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 463 transitions. [2018-11-10 05:36:09,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:09,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:09,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:09,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 11, 10, 9, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2018-11-10 05:36:09,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:36:09,085 INFO L793 eck$LassoCheckResult]: Stem: 11440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11439#L25 call main_#t~ret2 := fibo(main_~x~0);< 11473#fiboENTRY ~n := #in~n; 11554#L6 assume !(~n < 1); 11552#L8 assume !(~n == 1); 11549#L11 call #t~ret0 := fibo(~n - 1);< 11550#fiboENTRY ~n := #in~n; 11565#L6 assume !(~n < 1); 11563#L8 assume !(~n == 1); 11560#L11 call #t~ret0 := fibo(~n - 1);< 11561#fiboENTRY ~n := #in~n; 11571#L6 assume !(~n < 1); 11570#L8 assume !(~n == 1); 11556#L11 call #t~ret0 := fibo(~n - 1);< 11569#fiboENTRY ~n := #in~n; 11584#L6 assume !(~n < 1); 11582#L8 assume !(~n == 1); 11493#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11580#L6 assume !(~n < 1); 11686#L8 assume ~n == 1;#res := 1; 11685#fiboFINAL assume true; 11683#fiboEXIT >#33#return; 11681#L11-1 call #t~ret1 := fibo(~n - 2);< 11682#fiboENTRY ~n := #in~n; 11688#L6 assume ~n < 1;#res := 0; 11687#fiboFINAL assume true; 11680#fiboEXIT >#35#return; 11677#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11676#fiboFINAL assume true; 11674#fiboEXIT >#33#return; 11662#L11-1 call #t~ret1 := fibo(~n - 2);< 11664#fiboENTRY ~n := #in~n; 11691#L6 assume !(~n < 1); 11673#L8 assume ~n == 1;#res := 1; 11478#fiboFINAL assume true; 11661#fiboEXIT >#35#return; 11658#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11657#fiboFINAL assume true; 11635#fiboEXIT >#33#return; 11636#L11-1 call #t~ret1 := fibo(~n - 2);< 11641#fiboENTRY ~n := #in~n; 11675#L6 assume !(~n < 1); 11672#L8 assume !(~n == 1); 11442#L11 call #t~ret0 := fibo(~n - 1);< 11702#fiboENTRY ~n := #in~n; 11472#L6 assume !(~n < 1); 11441#L8 assume ~n == 1;#res := 1; 11444#fiboFINAL assume true; 11752#fiboEXIT >#33#return; 11649#L11-1 call #t~ret1 := fibo(~n - 2);< 11651#fiboENTRY ~n := #in~n; 11653#L6 assume ~n < 1;#res := 0; 11652#fiboFINAL assume true; 11648#fiboEXIT >#35#return; 11646#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11643#fiboFINAL assume true; 11639#fiboEXIT >#35#return; 11568#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11573#fiboFINAL assume true; 11566#fiboEXIT >#33#return; 11477#L11-1 call #t~ret1 := fibo(~n - 2);< 11488#fiboENTRY ~n := #in~n; 11486#L6 assume !(~n < 1); 11474#L8 assume !(~n == 1); 11447#L11 call #t~ret0 := fibo(~n - 1);< 11703#fiboENTRY ~n := #in~n; 11751#L6 assume !(~n < 1); 11750#L8 assume !(~n == 1); 11709#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-11-10 05:36:09,085 INFO L795 eck$LassoCheckResult]: Loop: 11708#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-11-10 05:36:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1797143672, now seen corresponding path program 4 times [2018-11-10 05:36:09,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:09,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 183 proven. 76 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-10 05:36:09,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:09,174 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:36:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:36:09,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:36:09,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:36:09,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 148 proven. 222 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 05:36:09,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:09,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 21 [2018-11-10 05:36:09,305 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:36:09,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 5 times [2018-11-10 05:36:09,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:09,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:09,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:09,335 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:09,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:09,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:09,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:09,335 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:09,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:09,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:09,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:09,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 05:36:09,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:09,335 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:09,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:09,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:09,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:09,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:09,371 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:09,372 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:09,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:09,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:09,379 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:36:09,379 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:09,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:09,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:09,408 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:36:09,408 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:09,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:09,430 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:09,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:09,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:10,237 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:10,238 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:10,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:10,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:10,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:10,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:10,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:10,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:10,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:10,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 05:36:10,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:10,239 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:10,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:10,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:10,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:10,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:10,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:10,274 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:10,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 05:36:10,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:10,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:10,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:10,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:10,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:10,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:10,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:10,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:10,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:36:10,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:10,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:10,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:10,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:10,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:10,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:10,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:10,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:10,277 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 05:36:10,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:10,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:10,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:10,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:10,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:10,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:10,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:10,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:36:10,279 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 05:36:10,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:10,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:10,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:10,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:10,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:10,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:10,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:10,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:10,284 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:10,285 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:10,285 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:10,285 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:10,285 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:10,285 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:10,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:10,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,404 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 05:36:10,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:10,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 05:36:10,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 336 states and 479 transitions. Complement of second has 18 states. [2018-11-10 05:36:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 05:36:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 05:36:10,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:10,439 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:10,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,530 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 05:36:10,530 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:10,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 05:36:10,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 342 states and 485 transitions. Complement of second has 17 states. [2018-11-10 05:36:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:36:10,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 05:36:10,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:10,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:10,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:10,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:10,698 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 05:36:10,698 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:10,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 05:36:10,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 399 states and 563 transitions. Complement of second has 27 states. [2018-11-10 05:36:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:36:10,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 05:36:10,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:10,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 90 letters. Loop has 4 letters. [2018-11-10 05:36:10,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:10,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 8 letters. [2018-11-10 05:36:10,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:10,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 563 transitions. [2018-11-10 05:36:10,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:10,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 321 states and 463 transitions. [2018-11-10 05:36:10,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-10 05:36:10,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-10 05:36:10,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 463 transitions. [2018-11-10 05:36:10,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:10,748 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 05:36:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 463 transitions. [2018-11-10 05:36:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-11-10 05:36:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-10 05:36:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-10 05:36:10,755 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 05:36:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 05:36:10,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-10 05:36:10,756 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 21 states. [2018-11-10 05:36:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:11,106 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2018-11-10 05:36:11,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 05:36:11,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 782 transitions. [2018-11-10 05:36:11,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:11,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 504 states and 778 transitions. [2018-11-10 05:36:11,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-10 05:36:11,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-10 05:36:11,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 778 transitions. [2018-11-10 05:36:11,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:11,115 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 778 transitions. [2018-11-10 05:36:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 778 transitions. [2018-11-10 05:36:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2018-11-10 05:36:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 05:36:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-10 05:36:11,123 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 05:36:11,123 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 05:36:11,123 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 05:36:11,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 653 transitions. [2018-11-10 05:36:11,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:11,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:36:11,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:36:11,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2018-11-10 05:36:11,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:36:11,127 INFO L793 eck$LassoCheckResult]: Stem: 14876#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14868#L25 call main_#t~ret2 := fibo(main_~x~0);< 14912#fiboENTRY ~n := #in~n; 14995#L6 assume !(~n < 1); 14993#L8 assume !(~n == 1); 14987#L11 call #t~ret0 := fibo(~n - 1);< 14990#fiboENTRY ~n := #in~n; 14991#L6 assume !(~n < 1); 14988#L8 assume !(~n == 1); 14926#L11 call #t~ret0 := fibo(~n - 1);< 14985#fiboENTRY ~n := #in~n; 14983#L6 assume !(~n < 1); 14981#L8 assume !(~n == 1); 14960#L11 call #t~ret0 := fibo(~n - 1);< 14977#fiboENTRY ~n := #in~n; 14976#L6 assume !(~n < 1); 14975#L8 assume !(~n == 1); 14940#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14958#L6 assume !(~n < 1); 15199#L8 assume ~n == 1;#res := 1; 15198#fiboFINAL assume true; 15195#fiboEXIT >#33#return; 15191#L11-1 call #t~ret1 := fibo(~n - 2);< 15192#fiboENTRY ~n := #in~n; 15197#L6 assume ~n < 1;#res := 0; 15194#fiboFINAL assume true; 15190#fiboEXIT >#35#return; 15188#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15186#fiboFINAL assume true; 15160#fiboEXIT >#33#return; 15054#L11-1 call #t~ret1 := fibo(~n - 2);< 15058#fiboENTRY ~n := #in~n; 15201#L6 assume !(~n < 1); 15071#L8 assume ~n == 1;#res := 1; 15069#fiboFINAL assume true; 15053#fiboEXIT >#35#return; 15051#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15049#fiboFINAL assume true; 15025#fiboEXIT >#33#return; 15026#L11-1 call #t~ret1 := fibo(~n - 2);< 15078#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(~n == 1); 15075#L11 call #t~ret0 := fibo(~n - 1);< 15144#fiboENTRY ~n := #in~n; 15200#L6 assume !(~n < 1); 15147#L8 assume ~n == 1;#res := 1; 15146#fiboFINAL assume true; 15143#fiboEXIT >#33#return; 15041#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15067#L6 assume ~n < 1;#res := 0; 15050#fiboFINAL assume true; 15038#fiboEXIT >#35#return; 15044#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15142#fiboFINAL assume true; 15138#fiboEXIT >#35#return; 15136#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14953#fiboFINAL assume true; 14948#fiboEXIT >#33#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14939#fiboENTRY ~n := #in~n; 14936#L6 assume !(~n < 1); 14938#L8 assume !(~n == 1); 14918#L11 call #t~ret0 := fibo(~n - 1);< 15151#fiboENTRY ~n := #in~n; 15178#L6 assume !(~n < 1); 15175#L8 assume !(~n == 1); 15171#L11 call #t~ret0 := fibo(~n - 1);< 15173#fiboENTRY ~n := #in~n; 15169#L6 assume !(~n < 1); 15176#L8 assume ~n == 1;#res := 1; 15174#fiboFINAL assume true; 15170#fiboEXIT >#33#return; 15155#L11-1 call #t~ret1 := fibo(~n - 2);< 14908#fiboENTRY ~n := #in~n; 15161#L6 assume ~n < 1;#res := 0; 15140#fiboFINAL assume true; 15154#fiboEXIT >#35#return; 15157#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15168#fiboFINAL assume true; 15150#fiboEXIT >#33#return; 15056#L11-1 call #t~ret1 := fibo(~n - 2);< 15059#fiboENTRY ~n := #in~n; 15163#L6 assume !(~n < 1); 15082#L8 assume ~n == 1;#res := 1; 14916#fiboFINAL assume true; 15055#fiboEXIT >#35#return; 15051#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15049#fiboFINAL assume true; 15025#fiboEXIT >#35#return; 15008#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15006#fiboFINAL assume true; 15001#fiboEXIT >#33#return; 14944#L11-1 call #t~ret1 := fibo(~n - 2);< 14927#fiboENTRY ~n := #in~n; 15123#L6 assume !(~n < 1); 15072#L8 assume !(~n == 1); 15073#L11 call #t~ret0 := fibo(~n - 1);< 15202#fiboENTRY ~n := #in~n; 15203#L6 assume !(~n < 1); 15242#L8 assume !(~n == 1); 14883#L11 call #t~ret0 := fibo(~n - 1);< 14911#fiboENTRY ~n := #in~n; 14913#L6 assume !(~n < 1); 14881#L8 assume !(~n == 1); 14882#L11 [2018-11-10 05:36:11,127 INFO L795 eck$LassoCheckResult]: Loop: 14882#L11 call #t~ret0 := fibo(~n - 1);< 14911#fiboENTRY ~n := #in~n; 14913#L6 assume !(~n < 1); 14881#L8 assume !(~n == 1); 14882#L11 [2018-11-10 05:36:11,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1400596499, now seen corresponding path program 5 times [2018-11-10 05:36:11,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:11,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 6 times [2018-11-10 05:36:11,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:36:11,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash 662415298, now seen corresponding path program 6 times [2018-11-10 05:36:11,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:36:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:36:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:36:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:36:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-11-10 05:36:11,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:36:11,311 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 05:36:11,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-10 05:36:11,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:36:11,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-10 05:36:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:36:11,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-11-10 05:36:11,509 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:11,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:11,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:11,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:11,510 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:36:11,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:11,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:11,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:11,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 05:36:11,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:11,510 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:11,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:11,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:11,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:11,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:11,537 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:11,537 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:11,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:36:11,540 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3351e65d-7d42-4c0c-af10-6f2e8637ba8c/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 05:36:11,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:36:11,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:36:13,466 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:36:13,467 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:36:13,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:36:13,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:36:13,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:36:13,467 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:36:13,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:36:13,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:36:13,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:36:13,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 05:36:13,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:36:13,468 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:36:13,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:13,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:13,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:13,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:36:13,501 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:36:13,501 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:36:13,501 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 05:36:13,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:36:13,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:36:13,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:36:13,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:36:13,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:36:13,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:36:13,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:36:13,504 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:36:13,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:36:13,505 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:36:13,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:36:13,505 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:36:13,505 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:36:13,506 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 05:36:13,506 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:36:13,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:13,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:13,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:13,631 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 05:36:13,632 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:13,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 05:36:13,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 432 states and 669 transitions. Complement of second has 18 states. [2018-11-10 05:36:13,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 05:36:13,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 05:36:13,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:13,670 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:13,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:13,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:13,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:13,839 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 05:36:13,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:13,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 05:36:13,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 438 states and 675 transitions. Complement of second has 17 states. [2018-11-10 05:36:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 05:36:13,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 05:36:13,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:13,920 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:36:13,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:14,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:14,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:36:14,081 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 05:36:14,081 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 05:36:14,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 05:36:14,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 513 states and 783 transitions. Complement of second has 27 states. [2018-11-10 05:36:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:36:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:36:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:36:14,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 05:36:14,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:14,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 132 letters. Loop has 4 letters. [2018-11-10 05:36:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:14,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 8 letters. [2018-11-10 05:36:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:36:14,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 783 transitions. [2018-11-10 05:36:14,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:36:14,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 417 states and 653 transitions. [2018-11-10 05:36:14,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-10 05:36:14,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-10 05:36:14,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 653 transitions. [2018-11-10 05:36:14,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:36:14,135 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 05:36:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 653 transitions. [2018-11-10 05:36:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-10 05:36:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 05:36:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-10 05:36:14,145 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 05:36:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 05:36:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-10 05:36:14,146 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand 25 states. [2018-11-10 05:36:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:36:14,546 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2018-11-10 05:36:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 05:36:14,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 922 transitions. [2018-11-10 05:36:14,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:36:14,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:36:14,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:36:14,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:36:14,550 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 05:36:14,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:36:14,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:36:14,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:36:14,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:36:14 BoogieIcfgContainer [2018-11-10 05:36:14,556 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:36:14,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:36:14,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:36:14,557 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:36:14,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:58" (3/4) ... [2018-11-10 05:36:14,561 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:36:14,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:36:14,562 INFO L168 Benchmark]: Toolchain (without parser) took 16163.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -353.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:36:14,563 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:36:14,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:36:14,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:36:14,564 INFO L168 Benchmark]: Boogie Preprocessor took 9.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:36:14,564 INFO L168 Benchmark]: RCFGBuilder took 148.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:36:14,565 INFO L168 Benchmark]: BuchiAutomizer took 15829.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -131.6 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:36:14,565 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:36:14,567 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 148.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15829.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -131.6 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 10.8s. Construction of modules took 1.1s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 474 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 417 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 355 SDtfs, 976 SDslu, 536 SDs, 0 SdLazy, 1912 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...