./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-635dfa2 [2018-12-08 12:46:53,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:46:53,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:46:53,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:46:53,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:46:53,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:46:53,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:46:53,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:46:53,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:46:53,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:46:53,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:46:53,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:46:53,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:46:53,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:46:53,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:46:53,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:46:53,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:46:53,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:46:53,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:46:53,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:46:53,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:46:53,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:46:53,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:46:53,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:46:53,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:46:53,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:46:53,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:46:53,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:46:53,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:46:53,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:46:53,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:46:53,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:46:53,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:46:53,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:46:53,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:46:53,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:46:53,341 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 12:46:53,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:46:53,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:46:53,350 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:46:53,350 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 12:46:53,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:46:53,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:46:53,351 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 12:46:53,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:46:53,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:46:53,352 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 12:46:53,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:46:53,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:46:53,352 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 12:46:53,353 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 12:46:53,353 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:53,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:46:53,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:46:53,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:46:53,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:46:53,379 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:46:53,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-12-08 12:46:53,413 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/data/b980c66c7/e55e6372f7294e69933a3f2514052d35/FLAGff70fd059 [2018-12-08 12:46:53,847 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:46:53,847 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-12-08 12:46:53,851 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/data/b980c66c7/e55e6372f7294e69933a3f2514052d35/FLAGff70fd059 [2018-12-08 12:46:53,860 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/bin-2019/uautomizer/data/b980c66c7/e55e6372f7294e69933a3f2514052d35 [2018-12-08 12:46:53,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:46:53,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:46:53,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:46:53,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:46:53,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:46:53,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:53,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489644d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53, skipping insertion in model container [2018-12-08 12:46:53,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:53,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:46:53,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:46:53,958 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:46:53,960 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:46:53,968 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:46:53,976 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:46:53,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53 WrapperNode [2018-12-08 12:46:53,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:46:53,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:46:53,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:46:53,977 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:46:53,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:53,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:53,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:46:53,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:46:53,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:46:53,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:46:54,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... [2018-12-08 12:46:54,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:46:54,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:46:54,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:46:54,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:46:54,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:46:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:46:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-08 12:46:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-08 12:46:54,142 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:46:54,142 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 12:46:54,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:46:54 BoogieIcfgContainer [2018-12-08 12:46:54,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:46:54,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 12:46:54,143 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 12:46:54,145 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 12:46:54,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:46:54,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 12:46:53" (1/3) ... [2018-12-08 12:46:54,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2f6840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:46:54, skipping insertion in model container [2018-12-08 12:46:54,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:46:54,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:46:53" (2/3) ... [2018-12-08 12:46:54,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2f6840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:46:54, skipping insertion in model container [2018-12-08 12:46:54,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:46:54,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:46:54" (3/3) ... [2018-12-08 12:46:54,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-12-08 12:46:54,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:46:54,181 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 12:46:54,181 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 12:46:54,181 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 12:46:54,181 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:46:54,182 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:46:54,182 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 12:46:54,182 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:46:54,182 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 12:46:54,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 12:46:54,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:54,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:54,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:46:54,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:46:54,214 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 12:46:54,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 12:46:54,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:54,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:54,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:46:54,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:46:54,221 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-12-08 12:46:54,221 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-12-08 12:46:54,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-12-08 12:46:54,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-12-08 12:46:54,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-12-08 12:46:54,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,353 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:54,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:54,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:54,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:54,354 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:46:54,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:54,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:54,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:54,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 12:46:54,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:54,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:54,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-12-08 12:46:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,432 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:54,433 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:54,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:54,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:54,443 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:54,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:54,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:54,460 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:54,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:54,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:54,477 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:54,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:54,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:54,494 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:54,508 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:46:54,524 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:54,540 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:46:54,541 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:54,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:54,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:54,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:54,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:46:54,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:54,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:54,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:54,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 12:46:54,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:54,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:54,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:54,581 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:54,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:46:54,585 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-12-08 12:46:54,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:54,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:54,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:54,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:54,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:54,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:54,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:54,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:54,591 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-12-08 12:46:54,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:54,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:54,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:54,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:54,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:54,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:54,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:54,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:54,594 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-12-08 12:46:54,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:54,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:54,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:54,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:54,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:54,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:54,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:54,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:54,597 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-12-08 12:46:54,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:54,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:54,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:54,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:54,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:54,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:54,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:54,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:54,600 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-12-08 12:46:54,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:54,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:54,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:54,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:54,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:54,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:54,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:54,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:46:54,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:46:54,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:46:54,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:46:54,608 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:46:54,609 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:46:54,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-12-08 12:46:54,610 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:46:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:54,683 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-12-08 12:46:54,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-12-08 12:46:54,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-12-08 12:46:54,743 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-12-08 12:46:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 12:46:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 12:46:54,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 12:46:54,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:54,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-08 12:46:54,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:54,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-08 12:46:54,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:54,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-12-08 12:46:54,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-12-08 12:46:54,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 12:46:54,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-08 12:46:54,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-12-08 12:46:54,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:54,756 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 12:46:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-12-08 12:46:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-08 12:46:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 12:46:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-08 12:46:54,774 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-08 12:46:54,774 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-08 12:46:54,774 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 12:46:54,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-12-08 12:46:54,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:54,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:54,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:54,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:54,775 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-12-08 12:46:54,775 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-12-08 12:46:54,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-12-08 12:46:54,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 12:46:54,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:54,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:54,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:46:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-12-08 12:46:54,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 12:46:54,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:46:54,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:46:54,847 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:46:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:46:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:46:54,850 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-08 12:46:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:54,890 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-08 12:46:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:46:54,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-12-08 12:46:54,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-12-08 12:46:54,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 12:46:54,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 12:46:54,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-12-08 12:46:54,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:54,893 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 12:46:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-12-08 12:46:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 12:46:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 12:46:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-08 12:46:54,895 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 12:46:54,895 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 12:46:54,895 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 12:46:54,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-08 12:46:54,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 12:46:54,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:54,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:54,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:54,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:54,897 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-12-08 12:46:54,897 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-12-08 12:46:54,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-12-08 12:46:54,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:54,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:46:54,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:54,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:54,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:54,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:46:54,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 12:46:54,964 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:46:54,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-12-08 12:46:54,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:55,026 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:55,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:55,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:55,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:55,026 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:46:55,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:55,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:55,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:55,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 12:46:55,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:55,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:55,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:55,059 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:55,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:55,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:55,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:46:55,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:55,565 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:46:55,566 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:55,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:55,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:55,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:55,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:46:55,567 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:55,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:55,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:55,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 12:46:55,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:55,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:55,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:55,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:55,601 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:46:55,601 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-12-08 12:46:55,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:55,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:55,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:55,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:55,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:55,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:55,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:55,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:55,604 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-12-08 12:46:55,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:55,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:55,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:55,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:55,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:55,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:55,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:55,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:46:55,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:46:55,612 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:46:55,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:46:55,612 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:46:55,612 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:46:55,612 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:46:55,612 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:46:55,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:55,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:55,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:55,693 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-12-08 12:46:55,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-12-08 12:46:55,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-12-08 12:46:55,790 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-12-08 12:46:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:46:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-08 12:46:55,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 12:46:55,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:55,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-12-08 12:46:55,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:55,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-12-08 12:46:55,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:55,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-12-08 12:46:55,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 12:46:55,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-12-08 12:46:55,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-08 12:46:55,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-08 12:46:55,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-12-08 12:46:55,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:55,802 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-12-08 12:46:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-12-08 12:46:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-12-08 12:46:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 12:46:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-12-08 12:46:55,812 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-12-08 12:46:55,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:46:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:46:55,813 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-12-08 12:46:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:55,859 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-08 12:46:55,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:46:55,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-12-08 12:46:55,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 12:46:55,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-12-08 12:46:55,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-08 12:46:55,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-08 12:46:55,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-12-08 12:46:55,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:55,864 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-12-08 12:46:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-12-08 12:46:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-08 12:46:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 12:46:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-08 12:46:55,869 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-08 12:46:55,869 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-08 12:46:55,869 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 12:46:55,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-12-08 12:46:55,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 12:46:55,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:55,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:55,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:55,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:55,871 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-12-08 12:46:55,871 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-12-08 12:46:55,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-12-08 12:46:55,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:55,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:55,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 12:46:55,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:46:55,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:55,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:55,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 12:46:55,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:46:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-08 12:46:55,955 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:46:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-12-08 12:46:55,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:56,009 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:56,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:56,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:56,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:56,010 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:46:56,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:56,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:56,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:56,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-12-08 12:46:56,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:56,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:56,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,038 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:56,038 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:56,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:56,040 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:56,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:46:56,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:56,541 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:46:56,542 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:56,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:56,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:56,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:56,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:46:56,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:56,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:56,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:56,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-12-08 12:46:56,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:56,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:56,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:56,582 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:46:56,583 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-12-08 12:46:56,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:56,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:56,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:56,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:56,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:56,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:56,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:56,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:56,585 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-12-08 12:46:56,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:56,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:56,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:56,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:56,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:56,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:56,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:56,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:56,588 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-12-08 12:46:56,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:56,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:56,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:56,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:56,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:56,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:56,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:56,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:46:56,591 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-12-08 12:46:56,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:56,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:56,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:56,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:56,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:56,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:56,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:56,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:46:56,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:46:56,598 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:46:56,598 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:46:56,598 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:46:56,598 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:46:56,598 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:46:56,599 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:46:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:56,680 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-12-08 12:46:56,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 12:46:56,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-12-08 12:46:56,759 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-12-08 12:46:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:46:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-08 12:46:56,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 12:46:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:56,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:46:56,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:56,848 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-12-08 12:46:56,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 12:46:56,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-12-08 12:46:56,920 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-12-08 12:46:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:46:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-08 12:46:56,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 12:46:56,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:56,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:46:56,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:56,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:56,984 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-12-08 12:46:56,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 12:46:57,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-12-08 12:46:57,084 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-12-08 12:46:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:46:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-12-08 12:46:57,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 12:46:57,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-12-08 12:46:57,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-12-08 12:46:57,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-12-08 12:46:57,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-08 12:46:57,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-12-08 12:46:57,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-12-08 12:46:57,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-12-08 12:46:57,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-12-08 12:46:57,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:57,107 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-12-08 12:46:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-12-08 12:46:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-12-08 12:46:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-08 12:46:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-08 12:46:57,131 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-08 12:46:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 12:46:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:46:57,131 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-12-08 12:46:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:57,249 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-12-08 12:46:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 12:46:57,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-12-08 12:46:57,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-08 12:46:57,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-12-08 12:46:57,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-12-08 12:46:57,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-12-08 12:46:57,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-12-08 12:46:57,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:57,259 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-12-08 12:46:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-12-08 12:46:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-12-08 12:46:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 12:46:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-12-08 12:46:57,271 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-08 12:46:57,271 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-08 12:46:57,271 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 12:46:57,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-12-08 12:46:57,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-08 12:46:57,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:57,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:57,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:57,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:46:57,273 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-12-08 12:46:57,274 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-12-08 12:46:57,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-12-08 12:46:57,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:57,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 12:46:57,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:46:57,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 12:46:57,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:46:57,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-08 12:46:57,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:46:57,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-12-08 12:46:57,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:57,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:57,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:57,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:46:57,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:57,414 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:57,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:57,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:57,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:57,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:46:57,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:57,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:57,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:57,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 12:46:57,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:57,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,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-12-08 12:46:57,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,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-12-08 12:46:57,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:57,438 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:57,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:57,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:57,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:57,443 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:57,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:57,458 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:57,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:46:57,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:57,490 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:46:57,492 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:57,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:57,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:57,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:57,492 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:46:57,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:57,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:57,492 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:57,492 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 12:46:57,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:57,492 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:57,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:57,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:57,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:46:57,518 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-12-08 12:46:57,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:46:57,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:46:57,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:46:57,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:46:57,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:46:57,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:46:57,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:46:57,520 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:46:57,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:46:57,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:46:57,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:46:57,522 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:46:57,522 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:46:57,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-12-08 12:46:57,522 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:46:57,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:57,579 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-12-08 12:46:57,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 12:46:57,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-08 12:46:57,613 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-12-08 12:46:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:46:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 12:46:57,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 12:46:57,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,614 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:46:57,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:57,697 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-12-08 12:46:57,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 12:46:57,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-08 12:46:57,735 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-12-08 12:46:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:46:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 12:46:57,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 12:46:57,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,736 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:46:57,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:57,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:57,805 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-12-08 12:46:57,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 12:46:57,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-12-08 12:46:57,844 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-12-08 12:46:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:46:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-08 12:46:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 12:46:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-08 12:46:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-08 12:46:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:46:57,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-12-08 12:46:57,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-08 12:46:57,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-12-08 12:46:57,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-12-08 12:46:57,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-12-08 12:46:57,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-12-08 12:46:57,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:57,855 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-12-08 12:46:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-12-08 12:46:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-12-08 12:46:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-08 12:46:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-12-08 12:46:57,867 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-12-08 12:46:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 12:46:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:46:57,868 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-12-08 12:46:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:46:58,036 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-12-08 12:46:58,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:46:58,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-12-08 12:46:58,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:46:58,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-12-08 12:46:58,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-12-08 12:46:58,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-12-08 12:46:58,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-12-08 12:46:58,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:46:58,040 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-12-08 12:46:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-12-08 12:46:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-12-08 12:46:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-08 12:46:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-08 12:46:58,044 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 12:46:58,044 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 12:46:58,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 12:46:58,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-12-08 12:46:58,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:46:58,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:46:58,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:46:58,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 12:46:58,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:46:58,046 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-12-08 12:46:58,046 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-12-08 12:46:58,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-12-08 12:46:58,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:58,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:58,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:46:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-08 12:46:58,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:46:58,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 12:46:58,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 12:46:58,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:46:58,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:46:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 12:46:58,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:46:58,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-12-08 12:46:58,273 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:46:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:46:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-12-08 12:46:58,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:46:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:46:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:58,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:46:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:46:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:58,318 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:46:58,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:46:58,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:46:58,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:46:58,319 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:46:58,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:46:58,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:46:58,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:46:58,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-12-08 12:46:58,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:46:58,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:46:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:58,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:58,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:58,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:46:58,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:46:58,344 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:58,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:58,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:46:58,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:46:58,348 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:58,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:46:58,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:46:58,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:46:58,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:03,736 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:47:03,739 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:03,739 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:03,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:03,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:03,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:47:03,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:03,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:03,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:03,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-12-08 12:47:03,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:03,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:03,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:03,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:03,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:03,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:03,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:03,771 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:47:03,771 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-12-08 12:47:03,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:03,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:03,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:03,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:03,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:03,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:03,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:03,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:47:03,776 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:47:03,777 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:47:03,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:47:03,777 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:47:03,777 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:47:03,777 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:47:03,777 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:47:03,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:03,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:03,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:03,852 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-12-08 12:47:03,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 12:47:03,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-12-08 12:47:03,882 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-12-08 12:47:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 12:47:03,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 12:47:03,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:03,882 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:03,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:03,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:03,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:03,942 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-12-08 12:47:03,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 12:47:03,986 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-12-08 12:47:03,986 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-12-08 12:47:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 12:47:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 12:47:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:03,987 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:03,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:04,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:04,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:04,046 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-12-08 12:47:04,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 12:47:04,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-12-08 12:47:04,082 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-12-08 12:47:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 12:47:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 12:47:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-12-08 12:47:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-12-08 12:47:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:04,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-12-08 12:47:04,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:04,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-12-08 12:47:04,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-12-08 12:47:04,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-12-08 12:47:04,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-12-08 12:47:04,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:04,087 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-12-08 12:47:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-12-08 12:47:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-12-08 12:47:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-08 12:47:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-08 12:47:04,092 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 12:47:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 12:47:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-12-08 12:47:04,093 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-12-08 12:47:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:47:04,276 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-12-08 12:47:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 12:47:04,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-12-08 12:47:04,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:04,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-12-08 12:47:04,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-12-08 12:47:04,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-12-08 12:47:04,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-12-08 12:47:04,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:04,281 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-12-08 12:47:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-12-08 12:47:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-12-08 12:47:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-08 12:47:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-08 12:47:04,286 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 12:47:04,286 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 12:47:04,286 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 12:47:04,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-12-08 12:47:04,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:04,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:47:04,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:47:04,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-08 12:47:04,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:47:04,289 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-12-08 12:47:04,289 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-12-08 12:47:04,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2018-12-08 12:47:04,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:04,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:04,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-08 12:47:04,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:47:04,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 12:47:04,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-08 12:47:04,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:47:04,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-08 12:47:04,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:47:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-08 12:47:04,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:47:04,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-12-08 12:47:04,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:04,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:04,414 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:04,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:04,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:04,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:04,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:47:04,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:04,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:04,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:04,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-12-08 12:47:04,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:04,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:04,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:04,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:04,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-12-08 12:47:04,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:04,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:04,445 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:04,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:04,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:04,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:47:04,448 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:04,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:04,464 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:04,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:47:04,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:05,240 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:47:05,242 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:05,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:05,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:05,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:05,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:47:05,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:05,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:05,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:05,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-12-08 12:47:05,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:05,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:05,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:05,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:05,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:05,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:05,286 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:05,286 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:47:05,286 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-12-08 12:47:05,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:05,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:05,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:05,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:05,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:05,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:05,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:05,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:47:05,288 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-12-08 12:47:05,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:05,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:05,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:05,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:05,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:05,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:05,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:05,290 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:47:05,291 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:47:05,292 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:47:05,292 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:47:05,292 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:47:05,292 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:47:05,292 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:47:05,292 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:47:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:05,376 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-12-08 12:47:05,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 12:47:05,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-12-08 12:47:05,412 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-12-08 12:47:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 12:47:05,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 12:47:05,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:05,412 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:05,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:05,483 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-12-08 12:47:05,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 12:47:05,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-12-08 12:47:05,528 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-12-08 12:47:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 12:47:05,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 12:47:05,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:05,528 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:05,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:05,603 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-12-08 12:47:05,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 12:47:05,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-12-08 12:47:05,643 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-12-08 12:47:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 12:47:05,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 12:47:05,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:05,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-12-08 12:47:05,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:05,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-08 12:47:05,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:05,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-12-08 12:47:05,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:05,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-12-08 12:47:05,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-08 12:47:05,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-12-08 12:47:05,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-12-08 12:47:05,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:05,653 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-12-08 12:47:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-12-08 12:47:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-12-08 12:47:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-08 12:47:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-08 12:47:05,661 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 12:47:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 12:47:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 12:47:05,661 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2018-12-08 12:47:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:47:05,765 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2018-12-08 12:47:05,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 12:47:05,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2018-12-08 12:47:05,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:05,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2018-12-08 12:47:05,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-12-08 12:47:05,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-12-08 12:47:05,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2018-12-08 12:47:05,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:05,772 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2018-12-08 12:47:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2018-12-08 12:47:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2018-12-08 12:47:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 12:47:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-12-08 12:47:05,790 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 12:47:05,790 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 12:47:05,790 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 12:47:05,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2018-12-08 12:47:05,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:05,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:47:05,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:47:05,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2018-12-08 12:47:05,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:47:05,794 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-12-08 12:47:05,794 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-12-08 12:47:05,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2018-12-08 12:47:05,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:05,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:05,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-08 12:47:05,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:47:05,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:05,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 12:47:05,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 12:47:05,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:47:05,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-08 12:47:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:47:05,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2018-12-08 12:47:05,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:47:05,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2018-12-08 12:47:05,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:05,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:05,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:06,017 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:06,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:06,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:06,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:06,018 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:47:06,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:06,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:06,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:06,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-12-08 12:47:06,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:06,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:06,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:06,045 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:06,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:06,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:06,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:47:06,048 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:06,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:06,063 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:06,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:47:06,065 INFO L448 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_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:06,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:06,079 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:06,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:47:06,097 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:06,784 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:47:06,786 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:06,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:06,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:06,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:06,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:47:06,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:06,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:06,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:06,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-12-08 12:47:06,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:06,786 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:06,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:06,813 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:06,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:47:06,814 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-12-08 12:47:06,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:06,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:06,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:06,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:06,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:06,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:06,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:06,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:47:06,815 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-12-08 12:47:06,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:06,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:06,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:06,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:06,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:06,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:06,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:06,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:47:06,816 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-12-08 12:47:06,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:06,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:06,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:06,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:06,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:06,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:06,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:06,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:47:06,817 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-12-08 12:47:06,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:06,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:06,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:06,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:06,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:06,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:06,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:06,820 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:47:06,821 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:47:06,821 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:47:06,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:47:06,822 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:47:06,822 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:47:06,822 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:47:06,822 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:47:06,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:06,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:06,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:06,921 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-12-08 12:47:06,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 12:47:06,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2018-12-08 12:47:06,950 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-12-08 12:47:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 12:47:06,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 12:47:06,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:06,951 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:06,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:07,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:07,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:07,035 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-12-08 12:47:07,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 12:47:07,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2018-12-08 12:47:07,075 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-12-08 12:47:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 12:47:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 12:47:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:07,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:07,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:07,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:07,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:07,162 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-12-08 12:47:07,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 12:47:07,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2018-12-08 12:47:07,208 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-12-08 12:47:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 12:47:07,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 12:47:07,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:07,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2018-12-08 12:47:07,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:07,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2018-12-08 12:47:07,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:07,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2018-12-08 12:47:07,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:07,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2018-12-08 12:47:07,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-12-08 12:47:07,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2018-12-08 12:47:07,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2018-12-08 12:47:07,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:07,217 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 12:47:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2018-12-08 12:47:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-08 12:47:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 12:47:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-12-08 12:47:07,224 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 12:47:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 12:47:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-08 12:47:07,224 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2018-12-08 12:47:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:47:07,528 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2018-12-08 12:47:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 12:47:07,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2018-12-08 12:47:07,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:07,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2018-12-08 12:47:07,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-12-08 12:47:07,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-12-08 12:47:07,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2018-12-08 12:47:07,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:07,538 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2018-12-08 12:47:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2018-12-08 12:47:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2018-12-08 12:47:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 12:47:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-12-08 12:47:07,549 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 12:47:07,549 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 12:47:07,549 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 12:47:07,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2018-12-08 12:47:07,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:07,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:47:07,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:47:07,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1] [2018-12-08 12:47:07,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 12:47:07,553 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14905#fiboENTRY ~n := #in~n; 15099#L6 assume !(~n < 1); 15095#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15090#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(1 == ~n); 15059#L11 call #t~ret0 := fibo(~n - 1);< 15066#fiboENTRY ~n := #in~n; 15064#L6 assume !(~n < 1); 15062#L8 assume !(1 == ~n); 15054#L11 call #t~ret0 := fibo(~n - 1);< 15058#fiboENTRY ~n := #in~n; 15057#L6 assume !(~n < 1); 15055#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14979#L6 assume !(~n < 1); 14976#L8 assume !(1 == ~n); 14932#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14959#L6 assume !(~n < 1); 15218#L8 assume 1 == ~n;#res := 1; 15217#fiboFINAL assume true; 15216#fiboEXIT >#32#return; 15214#L11-1 call #t~ret1 := fibo(~n - 2);< 15215#fiboENTRY ~n := #in~n; 15227#L6 assume ~n < 1;#res := 0; 15224#fiboFINAL assume true; 15213#fiboEXIT >#34#return; 15211#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15209#fiboFINAL assume true; 15208#fiboEXIT >#32#return; 15044#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15234#L6 assume !(~n < 1); 15053#L8 assume 1 == ~n;#res := 1; 14924#fiboFINAL assume true; 15043#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#32#return; 14986#L11-1 call #t~ret1 := fibo(~n - 2);< 14988#fiboENTRY ~n := #in~n; 15056#L6 assume !(~n < 1); 15052#L8 assume !(1 == ~n); 15022#L11 call #t~ret0 := fibo(~n - 1);< 15228#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15047#L8 assume 1 == ~n;#res := 1; 15036#fiboFINAL assume true; 15019#fiboEXIT >#32#return; 14996#L11-1 call #t~ret1 := fibo(~n - 2);< 15001#fiboENTRY ~n := #in~n; 15035#L6 assume ~n < 1;#res := 0; 15018#fiboFINAL assume true; 14993#fiboEXIT >#34#return; 14992#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14990#fiboFINAL assume true; 14985#fiboEXIT >#34#return; 14980#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14950#fiboFINAL assume true; 14942#fiboEXIT >#32#return; 14923#L11-1 call #t~ret1 := fibo(~n - 2);< 14934#fiboENTRY ~n := #in~n; 14928#L6 assume !(~n < 1); 14922#L8 assume !(1 == ~n); 14925#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15195#L8 assume !(1 == ~n); 15189#L11 call #t~ret0 := fibo(~n - 1);< 15191#fiboENTRY ~n := #in~n; 15148#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15188#fiboEXIT >#32#return; 15181#L11-1 call #t~ret1 := fibo(~n - 2);< 15187#fiboENTRY ~n := #in~n; 15198#L6 assume ~n < 1;#res := 0; 15142#fiboFINAL assume true; 15179#fiboEXIT >#34#return; 15185#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15204#fiboFINAL assume true; 15203#fiboEXIT >#32#return; 15042#L11-1 call #t~ret1 := fibo(~n - 2);< 15045#fiboENTRY ~n := #in~n; 15232#L6 assume !(~n < 1); 15048#L8 assume 1 == ~n;#res := 1; 15038#fiboFINAL assume true; 15041#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#34#return; 14944#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15221#fiboFINAL assume true; 15013#fiboEXIT >#32#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 15146#L6 assume !(~n < 1); 14977#L8 assume !(1 == ~n); 14978#L11 call #t~ret0 := fibo(~n - 1);< 15024#fiboENTRY ~n := #in~n; 15229#L6 assume !(~n < 1); 15266#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-12-08 12:47:07,553 INFO L796 eck$LassoCheckResult]: Loop: 14883#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-12-08 12:47:07,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash 79280042, now seen corresponding path program 5 times [2018-12-08 12:47:07,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:07,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:07,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2018-12-08 12:47:07,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:07,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:47:07,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash 477112511, now seen corresponding path program 6 times [2018-12-08 12:47:07,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:47:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:47:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:47:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:47:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-12-08 12:47:07,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:47:07,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-08 12:47:07,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-08 12:47:07,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:47:07,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-12-08 12:47:07,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:47:07,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-12-08 12:47:07,856 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:07,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:07,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:07,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:07,856 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:47:07,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:07,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:07,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:07,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 12:47:07,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:07,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:07,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:07,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:07,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:07,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:07,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:07,886 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:07,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:47:07,888 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_566cd818-616e-4ed5-ba1f-cd61058903ee/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-12-08 12:47:07,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:47:07,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:47:12,999 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:47:13,001 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:47:13,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:47:13,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:47:13,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:47:13,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:47:13,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:47:13,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:47:13,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:47:13,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 12:47:13,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:47:13,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:47:13,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:13,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:13,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:47:13,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:47:13,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:47:13,031 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-12-08 12:47:13,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:47:13,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:47:13,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:47:13,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:47:13,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:47:13,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:47:13,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:47:13,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:47:13,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:47:13,034 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:47:13,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:47:13,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:47:13,035 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:47:13,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 12:47:13,035 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 12:47:13,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:13,133 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-12-08 12:47:13,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 12:47:13,160 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2018-12-08 12:47:13,160 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-12-08 12:47:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 12:47:13,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 12:47:13,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:13,161 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:13,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:13,282 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-12-08 12:47:13,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 12:47:13,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2018-12-08 12:47:13,333 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-12-08 12:47:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 12:47:13,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 12:47:13,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:13,333 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:47:13,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:47:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:47:13,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:47:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:47:13,464 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-12-08 12:47:13,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 12:47:13,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2018-12-08 12:47:13,497 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-12-08 12:47:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 12:47:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 12:47:13,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 12:47:13,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:13,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2018-12-08 12:47:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:13,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 8 letters. [2018-12-08 12:47:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:47:13,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2018-12-08 12:47:13,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 12:47:13,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2018-12-08 12:47:13,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2018-12-08 12:47:13,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2018-12-08 12:47:13,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2018-12-08 12:47:13,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:47:13,504 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2018-12-08 12:47:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2018-12-08 12:47:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2018-12-08 12:47:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 12:47:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-12-08 12:47:13,510 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 12:47:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 12:47:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-12-08 12:47:13,510 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 25 states. [2018-12-08 12:47:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:47:13,820 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2018-12-08 12:47:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 12:47:13,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 864 transitions. [2018-12-08 12:47:13,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:47:13,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 12:47:13,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 12:47:13,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:47:13,823 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 12:47:13,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 12:47:13,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:47:13,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 12:47:13,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 12:47:13 BoogieIcfgContainer [2018-12-08 12:47:13,827 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 12:47:13,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:47:13,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:47:13,828 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:47:13,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:46:54" (3/4) ... [2018-12-08 12:47:13,830 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:47:13,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:47:13,831 INFO L168 Benchmark]: Toolchain (without parser) took 19968.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 962.4 MB in the beginning and 917.2 MB in the end (delta: 45.2 MB). Peak memory consumption was 359.2 MB. Max. memory is 11.5 GB. [2018-12-08 12:47:13,831 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:47:13,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 113.47 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:47:13,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.60 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:47:13,832 INFO L168 Benchmark]: Boogie Preprocessor took 9.72 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:47:13,832 INFO L168 Benchmark]: RCFGBuilder took 138.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -116.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-08 12:47:13,832 INFO L168 Benchmark]: BuchiAutomizer took 19684.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 917.2 MB in the end (delta: 145.3 MB). Peak memory consumption was 376.0 MB. Max. memory is 11.5 GB. [2018-12-08 12:47:13,833 INFO L168 Benchmark]: Witness Printer took 2.59 ms. Allocated memory is still 1.3 GB. Free memory is still 917.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:47:13,834 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 113.47 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.60 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.72 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -116.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19684.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 917.2 MB in the end (delta: 145.3 MB). Peak memory consumption was 376.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.59 ms. Allocated memory is still 1.3 GB. Free memory is still 917.2 MB. 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 19.6s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 15.4s. Construction of modules took 0.9s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 330 SDtfs, 948 SDslu, 470 SDs, 0 SdLazy, 1968 SolverSat, 776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...