./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 7e40a98558d0111ea95f3ee60a44cc14c7768182 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:43:23,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:43:23,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:43:23,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:43:23,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:43:23,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:43:23,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:43:23,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:43:23,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:43:23,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:43:23,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:43:23,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:43:23,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:43:23,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:43:23,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:43:23,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:43:23,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:43:23,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:43:23,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:43:23,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:43:23,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:43:23,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:43:23,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:43:23,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:43:23,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:43:23,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:43:23,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:43:23,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:43:23,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:43:23,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:43:23,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:43:23,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:43:23,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:43:23,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:43:23,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:43:23,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:43:23,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:43:23,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:43:23,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:43:23,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:43:23,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:43:23,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:43:23,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:43:23,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:43:23,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:43:23,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:43:23,258 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:43:23,259 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:43:23,259 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:43:23,259 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:43:23,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:43:23,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:43:23,260 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:43:23,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:43:23,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:43:23,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:43:23,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:43:23,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:43:23,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:43:23,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:43:23,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:43:23,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:43:23,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:43:23,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:43:23,263 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:43:23,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:43:23,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:43:23,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:43:23,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:43:23,265 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:43:23,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:43:23,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:43:23,265 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:43:23,266 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:43:23,266 INFO L138 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/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2019-11-15 23:43:23,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:43:23,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:43:23,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:43:23,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:43:23,325 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:43:23,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-15 23:43:23,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/data/7f8cf05df/b2112d4e3562488db7f851e09480362f/FLAG9a429f02e [2019-11-15 23:43:23,755 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:43:23,756 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-15 23:43:23,763 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/data/7f8cf05df/b2112d4e3562488db7f851e09480362f/FLAG9a429f02e [2019-11-15 23:43:24,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/data/7f8cf05df/b2112d4e3562488db7f851e09480362f [2019-11-15 23:43:24,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:43:24,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:43:24,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:24,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:43:24,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:43:24,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f10e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24, skipping insertion in model container [2019-11-15 23:43:24,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:43:24,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:43:24,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:24,391 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:43:24,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:24,514 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:43:24,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24 WrapperNode [2019-11-15 23:43:24,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:24,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:24,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:43:24,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:43:24,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:24,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:43:24,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:43:24,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:43:24,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... [2019-11-15 23:43:24,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:43:24,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:43:24,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:43:24,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:43:24,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-15 23:43:24,658 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-15 23:43:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:43:24,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:43:24,827 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:43:24,827 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:43:24,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:24 BoogieIcfgContainer [2019-11-15 23:43:24,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:43:24,829 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:43:24,830 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:43:24,833 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:43:24,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:43:24,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:43:24" (1/3) ... [2019-11-15 23:43:24,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65c17082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:43:24, skipping insertion in model container [2019-11-15 23:43:24,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:43:24,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:24" (2/3) ... [2019-11-15 23:43:24,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65c17082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:43:24, skipping insertion in model container [2019-11-15 23:43:24,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:43:24,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:24" (3/3) ... [2019-11-15 23:43:24,839 INFO L371 chiAutomizerObserver]: Analyzing ICFG Fibonacci02.c [2019-11-15 23:43:24,899 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:43:24,899 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:43:24,900 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:43:24,900 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:43:24,900 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:43:24,900 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:43:24,900 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:43:24,901 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:43:24,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:43:24,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:24,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:24,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:24,961 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:43:24,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:24,962 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:43:24,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:43:24,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:24,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:24,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:24,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:43:24,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:25,001 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2019-11-15 23:43:25,002 INFO L793 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2019-11-15 23:43:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2019-11-15 23:43:25,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:25,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413435040] [2019-11-15 23:43:25,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:25,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2019-11-15 23:43:25,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:25,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86093362] [2019-11-15 23:43:25,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2019-11-15 23:43:25,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:25,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655139042] [2019-11-15 23:43:25,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:25,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:25,148 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:25,267 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:25,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:25,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:25,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:25,268 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:25,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:25,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:25,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:25,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-15 23:43:25,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:25,269 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:25,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:25,428 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:43:25,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:25,452 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:25,463 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:25,464 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:43:25,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:25,476 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:25,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:25,483 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:43:25,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:25,507 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:25,514 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:25,514 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:25,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:25,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:25,537 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:25,537 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:43:25,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:25,546 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:25,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:25,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:25,616 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:25,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:25,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:25,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:25,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:25,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:25,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:25,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:25,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:25,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-15 23:43:25,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:25,624 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:25,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:25,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:25,713 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:25,715 INFO L120 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 [2019-11-15 23:43:25,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:25,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:25,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:25,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:25,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:25,720 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:25,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:25,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:25,726 INFO L120 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 [2019-11-15 23:43:25,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:25,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:25,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:25,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:25,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:25,729 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:25,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:25,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:25,731 INFO L120 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 [2019-11-15 23:43:25,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:25,732 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:25,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:25,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:25,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:25,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:25,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:25,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:25,736 INFO L120 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 [2019-11-15 23:43:25,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:25,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:25,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:25,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:25,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:25,739 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:25,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:25,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:25,742 INFO L120 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 [2019-11-15 23:43:25,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:25,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:25,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:25,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:25,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:25,745 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:25,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:25,757 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:25,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:25,769 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:25,773 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:25,773 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:25,773 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:25,774 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-11-15 23:43:25,780 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:25,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:43:25,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:25,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:25,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:25,932 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 [2019-11-15 23:43:25,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-11-15 23:43:26,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2019-11-15 23:43:26,067 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 [2019-11-15 23:43:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:43:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 23:43:26,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:43:26,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:26,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:43:26,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:26,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:43:26,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:26,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-15 23:43:26,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:26,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2019-11-15 23:43:26,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:43:26,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:43:26,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 23:43:26,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:26,107 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:43:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 23:43:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 23:43:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:43:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 23:43:26,138 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:43:26,138 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:43:26,138 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:43:26,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 23:43:26,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:26,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:26,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:26,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:26,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:26,141 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2019-11-15 23:43:26,141 INFO L793 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2019-11-15 23:43:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2019-11-15 23:43:26,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:26,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714904118] [2019-11-15 23:43:26,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:26,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714904118] [2019-11-15 23:43:26,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772491402] [2019-11-15 23:43:26,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:43:26,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:26,308 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:26,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:43:26,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959155588] [2019-11-15 23:43:26,311 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2019-11-15 23:43:26,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:26,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574587183] [2019-11-15 23:43:26,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:43:26,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574587183] [2019-11-15 23:43:26,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:26,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:43:26,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144521297] [2019-11-15 23:43:26,385 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:43:26,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:43:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:43:26,389 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 23:43:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:26,462 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-15 23:43:26,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:43:26,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 23:43:26,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:26,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-15 23:43:26,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:43:26,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:43:26,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 23:43:26,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:26,467 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:43:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 23:43:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:43:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:43:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 23:43:26,477 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:43:26,477 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:43:26,477 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:43:26,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 23:43:26,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:43:26,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:26,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:26,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:26,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:43:26,482 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 219#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 228#fibonacciENTRY ~n := #in~n; 225#L15 assume !(~n < 1); 226#L17 assume !(1 == ~n); 218#L20 call #t~ret0 := fibonacci(~n - 1);< 220#fibonacciENTRY ~n := #in~n; 223#L15 assume !(~n < 1); 224#L17 assume 1 == ~n;#res := 1; 229#fibonacciFINAL assume true; 235#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-15 23:43:26,483 INFO L793 eck$LassoCheckResult]: Loop: 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume 1 == ~n;#res := 1; 233#fibonacciFINAL assume true; 234#fibonacciEXIT >#28#return; 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume ~n < 1;#res := 0; 237#fibonacciFINAL assume true; 221#fibonacciEXIT >#30#return; 222#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 230#fibonacciFINAL assume true; 231#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-15 23:43:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2019-11-15 23:43:26,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:26,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367057471] [2019-11-15 23:43:26,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:26,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367057471] [2019-11-15 23:43:26,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826276780] [2019-11-15 23:43:26,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:26,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:43:26,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:26,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:26,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:43:26,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464042355] [2019-11-15 23:43:26,630 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 1 times [2019-11-15 23:43:26,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:26,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343360037] [2019-11-15 23:43:26,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:26,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:26,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:26,933 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:26,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:26,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:26,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:26,934 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:26,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:26,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:26,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:26,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-15 23:43:26,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:26,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:26,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:26,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:26,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:26,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:27,005 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:27,006 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:27,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:27,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:27,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:27,015 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=1} Honda state: {fibonacci_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:27,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:27,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:27,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:27,024 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:27,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:27,041 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:27,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:27,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:28,220 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:28,223 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:28,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:28,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:28,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:28,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:28,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:28,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:28,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:28,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-15 23:43:28,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:28,224 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:28,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:28,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:28,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:28,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:28,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:28,309 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:28,309 INFO L120 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 [2019-11-15 23:43:28,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:28,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:28,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:28,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:28,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:28,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:28,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:28,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:28,313 INFO L120 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 [2019-11-15 23:43:28,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:28,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:28,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:28,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:28,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:28,319 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:28,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:28,333 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:28,344 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:28,345 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:28,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:28,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:28,349 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:28,350 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-15 23:43:28,351 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:28,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:43:28,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:28,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:43:28,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:43:28,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:43:28,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-15 23:43:28,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 134 states and 182 transitions. Complement of second has 36 states. [2019-11-15 23:43:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:43:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:43:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 23:43:28,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 22 letters. [2019-11-15 23:43:28,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:28,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 33 letters. Loop has 22 letters. [2019-11-15 23:43:28,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:28,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 44 letters. [2019-11-15 23:43:28,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:28,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-15 23:43:28,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:43:28,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-15 23:43:28,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 23:43:28,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:43:28,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-15 23:43:28,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:28,865 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-15 23:43:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-15 23:43:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-15 23:43:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:43:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-15 23:43:28,881 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-15 23:43:28,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:43:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:43:28,881 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-15 23:43:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:28,994 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-15 23:43:28,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:43:28,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-15 23:43:29,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:43:29,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-15 23:43:29,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:43:29,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:43:29,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-15 23:43:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:29,012 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-15 23:43:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-15 23:43:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 23:43:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:43:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 23:43:29,034 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:43:29,034 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:43:29,034 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:43:29,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-15 23:43:29,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:43:29,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:29,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:29,046 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:29,046 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-15 23:43:29,046 INFO L791 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 795#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 803#fibonacciENTRY ~n := #in~n; 844#L15 assume !(~n < 1); 843#L17 assume !(1 == ~n); 794#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 810#L15 assume !(~n < 1); 842#L17 assume 1 == ~n;#res := 1; 841#fibonacciFINAL assume true; 840#fibonacciEXIT >#28#return; 813#L20-1 call #t~ret1 := fibonacci(~n - 2);< 838#fibonacciENTRY ~n := #in~n; 872#L15 assume ~n < 1;#res := 0; 871#fibonacciFINAL assume true; 870#fibonacciEXIT >#30#return; 869#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 866#fibonacciFINAL assume true; 863#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-15 23:43:29,047 INFO L793 eck$LassoCheckResult]: Loop: 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume ~n < 1;#res := 0; 846#fibonacciFINAL assume true; 868#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-15 23:43:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2019-11-15 23:43:29,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:29,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651684166] [2019-11-15 23:43:29,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:29,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651684166] [2019-11-15 23:43:29,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638580217] [2019-11-15 23:43:29,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:43:29,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:29,289 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:29,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-15 23:43:29,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336775350] [2019-11-15 23:43:29,289 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1986955448, now seen corresponding path program 2 times [2019-11-15 23:43:29,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:29,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894242958] [2019-11-15 23:43:29,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:43:29,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894242958] [2019-11-15 23:43:29,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292028647] [2019-11-15 23:43:29,396 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:29,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:43:29,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:29,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:43:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:43:29,479 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:29,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 23:43:29,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318267503] [2019-11-15 23:43:29,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:43:29,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:43:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:43:29,481 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-15 23:43:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:29,786 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-15 23:43:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:43:29,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-15 23:43:29,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:43:29,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-15 23:43:29,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-15 23:43:29,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 23:43:29,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-15 23:43:29,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:29,797 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:43:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-15 23:43:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 23:43:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:43:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-15 23:43:29,810 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:43:29,810 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:43:29,811 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:43:29,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-15 23:43:29,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:43:29,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:29,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:29,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:29,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 4, 4, 4, 4, 3, 3, 2, 2] [2019-11-15 23:43:29,818 INFO L791 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1301#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1308#fibonacciENTRY ~n := #in~n; 1349#L15 assume !(~n < 1); 1313#L17 assume !(1 == ~n); 1298#L20 call #t~ret0 := fibonacci(~n - 1);< 1310#fibonacciENTRY ~n := #in~n; 1306#L15 assume !(~n < 1); 1307#L17 assume !(1 == ~n); 1297#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1348#L15 assume !(~n < 1); 1346#L17 assume 1 == ~n;#res := 1; 1344#fibonacciFINAL assume true; 1343#fibonacciEXIT >#28#return; 1323#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1341#fibonacciENTRY ~n := #in~n; 1391#L15 assume ~n < 1;#res := 0; 1390#fibonacciFINAL assume true; 1389#fibonacciEXIT >#30#return; 1387#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1386#fibonacciFINAL assume true; 1382#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-15 23:43:29,819 INFO L793 eck$LassoCheckResult]: Loop: 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#28#return; 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#30#return; 1379#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1384#fibonacciFINAL assume true; 1378#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-15 23:43:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2008361138, now seen corresponding path program 2 times [2019-11-15 23:43:29,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:29,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208014164] [2019-11-15 23:43:29,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:29,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:29,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208014164] [2019-11-15 23:43:29,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406030626] [2019-11-15 23:43:29,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:29,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:43:29,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:29,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:43:30,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:30,020 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:30,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-15 23:43:30,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831832221] [2019-11-15 23:43:30,021 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1980387862, now seen corresponding path program 3 times [2019-11-15 23:43:30,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:30,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851333122] [2019-11-15 23:43:30,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:30,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:30,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-15 23:43:30,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851333122] [2019-11-15 23:43:30,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468322958] [2019-11-15 23:43:30,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:30,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 23:43:30,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:30,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:43:30,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 49 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 23:43:30,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:30,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2019-11-15 23:43:30,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820002293] [2019-11-15 23:43:30,297 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:43:30,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:43:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:43:30,298 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 14 states. [2019-11-15 23:43:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:30,668 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2019-11-15 23:43:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:43:30,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 171 transitions. [2019-11-15 23:43:30,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:43:30,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 125 states and 169 transitions. [2019-11-15 23:43:30,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-15 23:43:30,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-15 23:43:30,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 169 transitions. [2019-11-15 23:43:30,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:30,689 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-15 23:43:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 169 transitions. [2019-11-15 23:43:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-15 23:43:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:43:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2019-11-15 23:43:30,724 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-15 23:43:30,724 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-15 23:43:30,724 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:43:30,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 169 transitions. [2019-11-15 23:43:30,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:43:30,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:30,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:30,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:30,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:43:30,737 INFO L791 eck$LassoCheckResult]: Stem: 1935#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1921#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1936#fibonacciENTRY ~n := #in~n; 1933#L15 assume !(~n < 1); 1934#L17 assume !(1 == ~n); 1920#L20 call #t~ret0 := fibonacci(~n - 1);< 1922#fibonacciENTRY ~n := #in~n; 1940#L15 assume !(~n < 1); 1948#L17 assume !(1 == ~n); 1949#L20 call #t~ret0 := fibonacci(~n - 1);< 1990#fibonacciENTRY ~n := #in~n; 1989#L15 assume !(~n < 1); 1988#L17 assume !(1 == ~n); 1975#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1985#L15 assume !(~n < 1); 1984#L17 assume 1 == ~n;#res := 1; 1982#fibonacciFINAL assume true; 1980#fibonacciEXIT >#28#return; 1955#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1977#fibonacciENTRY ~n := #in~n; 2028#L15 assume ~n < 1;#res := 0; 2026#fibonacciFINAL assume true; 2025#fibonacciEXIT >#30#return; 2024#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2023#fibonacciFINAL assume true; 2017#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-15 23:43:30,739 INFO L793 eck$LassoCheckResult]: Loop: 1944#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume 1 == ~n;#res := 1; 1947#fibonacciFINAL assume true; 2012#fibonacciEXIT >#28#return; 1917#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1919#fibonacciENTRY ~n := #in~n; 2035#L15 assume ~n < 1;#res := 0; 2036#fibonacciFINAL assume true; 2030#fibonacciEXIT >#30#return; 2013#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2027#fibonacciFINAL assume true; 2018#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-15 23:43:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 463907735, now seen corresponding path program 3 times [2019-11-15 23:43:30,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:30,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271275433] [2019-11-15 23:43:30,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:30,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:30,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:30,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271275433] [2019-11-15 23:43:30,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961294050] [2019-11-15 23:43:30,965 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:31,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 23:43:31,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:31,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:43:31,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:31,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:31,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-11-15 23:43:31,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327578542] [2019-11-15 23:43:31,060 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 4 times [2019-11-15 23:43:31,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:31,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343068797] [2019-11-15 23:43:31,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:31,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:31,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:31,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:31,313 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:31,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:31,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:31,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:31,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:31,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:31,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:31,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:31,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-15 23:43:31,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:31,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:31,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:31,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:31,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:31,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:31,377 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:31,377 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:31,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:31,391 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:31,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:31,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:32,362 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:32,364 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:32,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:32,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:32,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:32,365 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:32,365 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:32,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:32,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:32,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-15 23:43:32,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:32,365 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:32,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:32,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:32,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:32,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:32,412 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:32,413 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:32,413 INFO L120 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 [2019-11-15 23:43:32,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:32,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:32,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:32,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:32,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:32,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:32,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:32,423 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:32,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:32,430 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:32,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:32,430 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:32,430 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:32,431 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-15 23:43:32,431 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:32,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:43:32,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:32,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:43:32,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:43:32,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:43:32,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-15 23:43:32,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 194 states and 261 transitions. Complement of second has 33 states. [2019-11-15 23:43:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:43:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:43:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 23:43:32,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-15 23:43:32,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:32,881 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:32,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:43:32,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:32,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:33,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:43:33,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:43:33,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:43:33,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-15 23:43:33,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 319 states and 430 transitions. Complement of second has 25 states. [2019-11-15 23:43:33,280 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 [2019-11-15 23:43:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:43:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 23:43:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-15 23:43:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:33,282 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:33,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:43:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:33,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:33,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:33,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:43:33,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:43:33,488 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 6 loop predicates [2019-11-15 23:43:33,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-15 23:43:33,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 1094 states and 1539 transitions. Complement of second has 130 states. [2019-11-15 23:43:33,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:43:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:43:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 23:43:33,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-15 23:43:33,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:33,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 57 letters. Loop has 22 letters. [2019-11-15 23:43:33,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:33,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 44 letters. [2019-11-15 23:43:33,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:33,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1094 states and 1539 transitions. [2019-11-15 23:43:33,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-15 23:43:33,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1094 states to 618 states and 954 transitions. [2019-11-15 23:43:33,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2019-11-15 23:43:33,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2019-11-15 23:43:33,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 954 transitions. [2019-11-15 23:43:33,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:33,869 INFO L688 BuchiCegarLoop]: Abstraction has 618 states and 954 transitions. [2019-11-15 23:43:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 954 transitions. [2019-11-15 23:43:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 494. [2019-11-15 23:43:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-15 23:43:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-15 23:43:33,929 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-15 23:43:33,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:43:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:43:33,930 INFO L87 Difference]: Start difference. First operand 494 states and 746 transitions. Second operand 16 states. [2019-11-15 23:43:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:34,282 INFO L93 Difference]: Finished difference Result 567 states and 846 transitions. [2019-11-15 23:43:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:43:34,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 846 transitions. [2019-11-15 23:43:34,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:34,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 561 states and 837 transitions. [2019-11-15 23:43:34,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2019-11-15 23:43:34,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2019-11-15 23:43:34,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 837 transitions. [2019-11-15 23:43:34,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:34,308 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 837 transitions. [2019-11-15 23:43:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 837 transitions. [2019-11-15 23:43:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 534. [2019-11-15 23:43:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-15 23:43:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 805 transitions. [2019-11-15 23:43:34,337 INFO L711 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-15 23:43:34,338 INFO L591 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-15 23:43:34,338 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:43:34,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 534 states and 805 transitions. [2019-11-15 23:43:34,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:34,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:34,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:34,347 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:34,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:34,348 INFO L791 eck$LassoCheckResult]: Stem: 5645#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 5646#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 5647#fibonacciENTRY ~n := #in~n; 5648#L15 assume !(~n < 1); 5711#L17 assume !(1 == ~n); 5707#L20 call #t~ret0 := fibonacci(~n - 1);< 5710#fibonacciENTRY ~n := #in~n; 5709#L15 assume !(~n < 1); 5708#L17 assume !(1 == ~n); 5703#L20 call #t~ret0 := fibonacci(~n - 1);< 5706#fibonacciENTRY ~n := #in~n; 5705#L15 assume !(~n < 1); 5704#L17 assume !(1 == ~n); 5699#L20 call #t~ret0 := fibonacci(~n - 1);< 5701#fibonacciENTRY ~n := #in~n; 5702#L15 assume !(~n < 1); 5698#L17 assume !(1 == ~n); 5652#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5697#L15 assume !(~n < 1); 5700#L17 assume !(1 == ~n); 5651#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5696#L15 assume !(~n < 1); 5650#L17 assume 1 == ~n;#res := 1; 5653#fibonacciFINAL assume true; 6047#fibonacciEXIT >#28#return; 5636#L20-1 call #t~ret1 := fibonacci(~n - 2);< 5899#fibonacciENTRY ~n := #in~n; 5935#L15 assume !(~n < 1); 5927#L17 assume !(1 == ~n); 5928#L20 call #t~ret0 := fibonacci(~n - 1);< 5937#fibonacciENTRY ~n := #in~n; 6049#L15 assume !(~n < 1); 5939#L17 assume !(1 == ~n); 5940#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-15 23:43:34,348 INFO L793 eck$LassoCheckResult]: Loop: 5957#fibonacciENTRY ~n := #in~n; 5970#L15 assume !(~n < 1); 5967#L17 assume !(1 == ~n); 5955#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-15 23:43:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2028848867, now seen corresponding path program 1 times [2019-11-15 23:43:34,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:34,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273894193] [2019-11-15 23:43:34,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:34,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:34,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273894193] [2019-11-15 23:43:34,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554910253] [2019-11-15 23:43:34,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:34,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:43:34,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:43:34,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:34,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 22 [2019-11-15 23:43:34,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949423529] [2019-11-15 23:43:34,695 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2019-11-15 23:43:34,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:34,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25869185] [2019-11-15 23:43:34,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:34,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:34,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:34,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:34,729 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:34,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:34,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:34,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:34,730 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:34,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:34,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:34,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:34,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-15 23:43:34,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:34,730 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:34,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,784 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:34,784 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:34,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:34,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:34,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:34,793 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:34,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:34,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:34,802 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:34,802 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:34,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:34,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:34,814 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:34,814 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:34,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:34,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:34,833 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:34,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:34,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:34,844 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:34,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:34,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:34,867 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:34,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:34,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:34,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:34,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:34,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:34,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:34,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:34,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:34,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-15 23:43:34,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:34,870 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:34,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:34,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:34,917 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:34,918 INFO L120 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 [2019-11-15 23:43:34,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:34,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:34,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:34,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:34,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:34,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:34,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:34,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:34,920 INFO L120 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 [2019-11-15 23:43:34,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:34,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:34,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:34,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:34,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:34,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:34,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:34,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:34,921 INFO L120 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 [2019-11-15 23:43:34,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:34,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:34,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:34,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:34,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:34,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:34,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:34,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:34,923 INFO L120 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 [2019-11-15 23:43:34,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:34,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:34,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:34,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:34,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:34,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:34,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:34,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:34,925 INFO L120 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 [2019-11-15 23:43:34,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:34,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:34,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:34,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:34,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:34,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:34,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:34,929 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:34,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:34,931 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:34,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:34,931 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:34,932 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:34,932 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-11-15 23:43:34,932 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:35,101 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 [2019-11-15 23:43:35,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-15 23:43:35,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-15 23:43:35,191 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 [2019-11-15 23:43:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:43:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:43:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-15 23:43:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:35,192 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:35,291 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 [2019-11-15 23:43:35,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-15 23:43:35,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-15 23:43:35,367 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 [2019-11-15 23:43:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:43:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:43:35,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-15 23:43:35,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:35,368 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:35,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:35,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:35,483 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 [2019-11-15 23:43:35,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-15 23:43:35,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 701 states and 990 transitions. Complement of second has 14 states. [2019-11-15 23:43:35,572 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 [2019-11-15 23:43:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:43:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 23:43:35,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-15 23:43:35,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:35,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-15 23:43:35,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:35,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 8 letters. [2019-11-15 23:43:35,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:35,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 701 states and 990 transitions. [2019-11-15 23:43:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:35,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 701 states to 588 states and 865 transitions. [2019-11-15 23:43:35,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2019-11-15 23:43:35,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2019-11-15 23:43:35,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 588 states and 865 transitions. [2019-11-15 23:43:35,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:35,601 INFO L688 BuchiCegarLoop]: Abstraction has 588 states and 865 transitions. [2019-11-15 23:43:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states and 865 transitions. [2019-11-15 23:43:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 558. [2019-11-15 23:43:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-15 23:43:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 829 transitions. [2019-11-15 23:43:35,623 INFO L711 BuchiCegarLoop]: Abstraction has 558 states and 829 transitions. [2019-11-15 23:43:35,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:43:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:43:35,624 INFO L87 Difference]: Start difference. First operand 558 states and 829 transitions. Second operand 22 states. [2019-11-15 23:43:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:36,052 INFO L93 Difference]: Finished difference Result 650 states and 972 transitions. [2019-11-15 23:43:36,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:43:36,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 972 transitions. [2019-11-15 23:43:36,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:36,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 635 states and 951 transitions. [2019-11-15 23:43:36,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-15 23:43:36,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-15 23:43:36,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 951 transitions. [2019-11-15 23:43:36,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:36,071 INFO L688 BuchiCegarLoop]: Abstraction has 635 states and 951 transitions. [2019-11-15 23:43:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 951 transitions. [2019-11-15 23:43:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 590. [2019-11-15 23:43:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-15 23:43:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 881 transitions. [2019-11-15 23:43:36,092 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-15 23:43:36,092 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-15 23:43:36,092 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:43:36,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 881 transitions. [2019-11-15 23:43:36,097 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:36,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:36,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:36,098 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:36,098 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:36,099 INFO L791 eck$LassoCheckResult]: Stem: 9768#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 9769#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 9770#fibonacciENTRY ~n := #in~n; 9856#L15 assume !(~n < 1); 9855#L17 assume !(1 == ~n); 9831#L20 call #t~ret0 := fibonacci(~n - 1);< 9832#fibonacciENTRY ~n := #in~n; 9839#L15 assume !(~n < 1); 9836#L17 assume !(1 == ~n); 9834#L20 call #t~ret0 := fibonacci(~n - 1);< 9850#fibonacciENTRY ~n := #in~n; 9854#L15 assume !(~n < 1); 9853#L17 assume !(1 == ~n); 9845#L20 call #t~ret0 := fibonacci(~n - 1);< 9852#fibonacciENTRY ~n := #in~n; 9876#L15 assume !(~n < 1); 9874#L17 assume !(1 == ~n); 9841#L20 call #t~ret0 := fibonacci(~n - 1);< 9849#fibonacciENTRY ~n := #in~n; 9912#L15 assume !(~n < 1); 9910#L17 assume !(1 == ~n); 9866#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 9986#L15 assume !(~n < 1); 9985#L17 assume !(1 == ~n); 9863#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 10011#L15 assume !(~n < 1); 10068#L17 assume 1 == ~n;#res := 1; 10067#fibonacciFINAL assume true; 10066#fibonacciEXIT >#28#return; 9772#L20-1 call #t~ret1 := fibonacci(~n - 2);< 9984#fibonacciENTRY ~n := #in~n; 10248#L15 assume !(~n < 1); 10240#L17 assume !(1 == ~n); 10241#L20 call #t~ret0 := fibonacci(~n - 1);< 10250#fibonacciENTRY ~n := #in~n; 10267#L15 assume !(~n < 1); 10264#L17 assume !(1 == ~n); 9803#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-15 23:43:36,099 INFO L793 eck$LassoCheckResult]: Loop: 9801#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-15 23:43:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1567609232, now seen corresponding path program 2 times [2019-11-15 23:43:36,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:36,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927812131] [2019-11-15 23:43:36,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:36,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:36,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:36,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927812131] [2019-11-15 23:43:36,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536370751] [2019-11-15 23:43:36,388 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:36,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:43:36,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:36,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:43:36,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 75 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:43:36,459 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:36,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 26 [2019-11-15 23:43:36,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630494639] [2019-11-15 23:43:36,460 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2019-11-15 23:43:36,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:36,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521916987] [2019-11-15 23:43:36,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:36,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:36,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:36,463 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:36,496 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:36,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:36,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:36,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:36,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:36,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:36,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:36,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:36,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-15 23:43:36,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:36,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:36,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:36,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:36,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:36,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:36,545 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:36,546 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:36,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:36,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:36,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:36,558 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:36,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:36,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:36,564 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:36,565 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:36,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:36,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:36,572 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:36,572 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:36,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:36,576 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/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 [2019-11-15 23:43:36,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:36,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:37,498 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:37,499 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:37,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:37,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:37,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:37,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:37,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:37,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:37,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:37,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-15 23:43:37,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:37,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:37,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:37,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:37,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:37,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:37,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:37,551 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:37,551 INFO L120 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 [2019-11-15 23:43:37,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:37,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:37,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:37,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:37,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:37,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:37,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:37,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:37,553 INFO L120 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 [2019-11-15 23:43:37,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:37,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:37,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:37,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:37,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:37,554 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:37,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:37,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:37,555 INFO L120 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 [2019-11-15 23:43:37,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:37,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:37,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:37,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:37,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:37,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:37,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:37,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:37,557 INFO L120 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 [2019-11-15 23:43:37,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:37,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:37,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:37,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:37,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:37,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:37,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:37,560 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:37,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:37,561 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:37,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:37,562 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:37,562 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:37,562 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-15 23:43:37,562 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:37,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:43:37,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:37,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:37,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:37,703 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 [2019-11-15 23:43:37,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-15 23:43:37,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 608 states and 900 transitions. Complement of second has 18 states. [2019-11-15 23:43:37,768 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 [2019-11-15 23:43:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:43:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-15 23:43:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:37,769 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:43:37,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:37,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:37,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:37,918 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 [2019-11-15 23:43:37,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-15 23:43:38,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 838 states and 1222 transitions. Complement of second has 22 states. [2019-11-15 23:43:38,032 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 [2019-11-15 23:43:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:43:38,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-15 23:43:38,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:38,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-15 23:43:38,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:38,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-15 23:43:38,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:38,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 838 states and 1222 transitions. [2019-11-15 23:43:38,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:38,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 838 states to 768 states and 1147 transitions. [2019-11-15 23:43:38,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2019-11-15 23:43:38,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-15 23:43:38,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 768 states and 1147 transitions. [2019-11-15 23:43:38,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:38,072 INFO L688 BuchiCegarLoop]: Abstraction has 768 states and 1147 transitions. [2019-11-15 23:43:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 1147 transitions. [2019-11-15 23:43:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 755. [2019-11-15 23:43:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-15 23:43:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1130 transitions. [2019-11-15 23:43:38,100 INFO L711 BuchiCegarLoop]: Abstraction has 755 states and 1130 transitions. [2019-11-15 23:43:38,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 23:43:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:43:38,101 INFO L87 Difference]: Start difference. First operand 755 states and 1130 transitions. Second operand 26 states. [2019-11-15 23:43:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:38,686 INFO L93 Difference]: Finished difference Result 855 states and 1274 transitions. [2019-11-15 23:43:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:43:38,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 855 states and 1274 transitions. [2019-11-15 23:43:38,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:38,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 855 states to 838 states and 1248 transitions. [2019-11-15 23:43:38,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2019-11-15 23:43:38,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-11-15 23:43:38,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1248 transitions. [2019-11-15 23:43:38,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:38,723 INFO L688 BuchiCegarLoop]: Abstraction has 838 states and 1248 transitions. [2019-11-15 23:43:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1248 transitions. [2019-11-15 23:43:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 813. [2019-11-15 23:43:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 23:43:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-15 23:43:38,773 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-15 23:43:38,774 INFO L591 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-15 23:43:38,774 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:43:38,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 813 states and 1193 transitions. [2019-11-15 23:43:38,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:38,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:38,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:38,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 10, 9, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:38,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:38,786 INFO L791 eck$LassoCheckResult]: Stem: 13937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 13938#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 13947#fibonacciENTRY ~n := #in~n; 14064#L15 assume !(~n < 1); 14060#L17 assume !(1 == ~n); 14042#L20 call #t~ret0 := fibonacci(~n - 1);< 14053#fibonacciENTRY ~n := #in~n; 14423#L15 assume !(~n < 1); 14342#L17 assume !(1 == ~n); 14044#L20 call #t~ret0 := fibonacci(~n - 1);< 14045#fibonacciENTRY ~n := #in~n; 14147#L15 assume !(~n < 1); 14146#L17 assume !(1 == ~n); 14143#L20 call #t~ret0 := fibonacci(~n - 1);< 14145#fibonacciENTRY ~n := #in~n; 14268#L15 assume !(~n < 1); 14266#L17 assume !(1 == ~n); 14258#L20 call #t~ret0 := fibonacci(~n - 1);< 14265#fibonacciENTRY ~n := #in~n; 14263#L15 assume !(~n < 1); 14261#L17 assume !(1 == ~n); 14163#L20 call #t~ret0 := fibonacci(~n - 1);< 14259#fibonacciENTRY ~n := #in~n; 14348#L15 assume !(~n < 1); 14347#L17 assume !(1 == ~n); 14276#L20 call #t~ret0 := fibonacci(~n - 1);< 14345#fibonacciENTRY ~n := #in~n; 14372#L15 assume !(~n < 1); 14371#L17 assume !(1 == ~n); 14277#L20 call #t~ret0 := fibonacci(~n - 1);< 14370#fibonacciENTRY ~n := #in~n; 14427#L15 assume !(~n < 1); 14426#L17 assume 1 == ~n;#res := 1; 14425#fibonacciFINAL assume true; 14424#fibonacciEXIT >#28#return; 14414#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14417#fibonacciENTRY ~n := #in~n; 14420#L15 assume ~n < 1;#res := 0; 14418#fibonacciFINAL assume true; 14413#fibonacciEXIT >#30#return; 14411#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14410#fibonacciFINAL assume true; 14344#fibonacciEXIT >#28#return; 14270#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14281#fibonacciENTRY ~n := #in~n; 14361#L15 assume !(~n < 1); 14368#L17 assume !(1 == ~n); 14048#L20 call #t~ret0 := fibonacci(~n - 1);< 14359#fibonacciENTRY ~n := #in~n; 14393#L15 assume !(~n < 1); 14392#L17 assume !(1 == ~n); 14029#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-15 23:43:38,786 INFO L793 eck$LassoCheckResult]: Loop: 14032#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-15 23:43:38,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:38,787 INFO L82 PathProgramCache]: Analyzing trace with hash 439095810, now seen corresponding path program 4 times [2019-11-15 23:43:38,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:38,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477782120] [2019-11-15 23:43:38,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:38,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:38,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 20 proven. 205 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:43:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477782120] [2019-11-15 23:43:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925241778] [2019-11-15 23:43:39,145 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:39,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:43:39,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:39,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:43:39,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 95 proven. 120 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:43:39,251 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:39,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-15 23:43:39,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710274215] [2019-11-15 23:43:39,252 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2019-11-15 23:43:39,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:39,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525604877] [2019-11-15 23:43:39,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:39,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:39,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:39,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:39,295 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:39,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:39,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:39,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:39,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:39,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:39,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:39,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:39,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-15 23:43:39,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:39,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:39,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:39,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:39,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:39,356 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:39,357 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:39,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:39,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:39,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:39,363 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:39,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:39,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:39,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:39,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:39,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:39,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:39,387 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:39,387 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:39,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:39,395 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:43:39,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:39,415 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:40,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:40,333 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:40,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:40,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:40,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:40,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:40,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:40,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:40,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:40,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-15 23:43:40,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:40,334 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:40,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:40,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:40,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:40,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:40,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:40,384 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:40,384 INFO L120 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 [2019-11-15 23:43:40,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:40,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:40,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:40,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:40,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:40,385 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:40,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:40,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:40,386 INFO L120 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 [2019-11-15 23:43:40,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:40,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:40,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:40,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:40,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:40,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:40,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:40,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:40,387 INFO L120 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 [2019-11-15 23:43:40,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:40,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:40,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:40,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:40,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:40,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:40,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:40,390 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:40,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:40,392 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:40,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:40,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:40,393 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:40,393 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-15 23:43:40,393 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:40,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:40,535 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 [2019-11-15 23:43:40,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-15 23:43:40,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 838 states and 1219 transitions. Complement of second has 18 states. [2019-11-15 23:43:40,603 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 [2019-11-15 23:43:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:43:40,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-15 23:43:40,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:40,604 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:40,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:40,744 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 [2019-11-15 23:43:40,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-15 23:43:40,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1019 states and 1430 transitions. Complement of second has 22 states. [2019-11-15 23:43:40,840 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 [2019-11-15 23:43:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:43:40,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-15 23:43:40,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:40,842 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:40,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:41,001 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 [2019-11-15 23:43:41,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-15 23:43:41,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1102 states and 1565 transitions. Complement of second has 27 states. [2019-11-15 23:43:41,077 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 [2019-11-15 23:43:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:43:41,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-15 23:43:41,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:41,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-15 23:43:41,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 8 letters. [2019-11-15 23:43:41,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:41,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1565 transitions. [2019-11-15 23:43:41,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:43:41,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 813 states and 1193 transitions. [2019-11-15 23:43:41,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-15 23:43:41,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2019-11-15 23:43:41,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 813 states and 1193 transitions. [2019-11-15 23:43:41,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:41,105 INFO L688 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-15 23:43:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states and 1193 transitions. [2019-11-15 23:43:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2019-11-15 23:43:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 23:43:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-15 23:43:41,130 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-15 23:43:41,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 23:43:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:43:41,131 INFO L87 Difference]: Start difference. First operand 813 states and 1193 transitions. Second operand 28 states. [2019-11-15 23:43:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:41,698 INFO L93 Difference]: Finished difference Result 387 states and 486 transitions. [2019-11-15 23:43:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:43:41,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 486 transitions. [2019-11-15 23:43:41,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:43:41,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 353 states and 450 transitions. [2019-11-15 23:43:41,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-15 23:43:41,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-11-15 23:43:41,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 450 transitions. [2019-11-15 23:43:41,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:41,707 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 450 transitions. [2019-11-15 23:43:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 450 transitions. [2019-11-15 23:43:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2019-11-15 23:43:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-15 23:43:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-15 23:43:41,717 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-15 23:43:41,717 INFO L591 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-15 23:43:41,718 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:43:41,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 419 transitions. [2019-11-15 23:43:41,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:43:41,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:43:41,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:43:41,721 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:41,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:43:41,722 INFO L791 eck$LassoCheckResult]: Stem: 19787#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 19788#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 19789#fibonacciENTRY ~n := #in~n; 19847#L15 assume !(~n < 1); 19846#L17 assume !(1 == ~n); 19842#L20 call #t~ret0 := fibonacci(~n - 1);< 19845#fibonacciENTRY ~n := #in~n; 19844#L15 assume !(~n < 1); 19843#L17 assume !(1 == ~n); 19838#L20 call #t~ret0 := fibonacci(~n - 1);< 19841#fibonacciENTRY ~n := #in~n; 19840#L15 assume !(~n < 1); 19839#L17 assume !(1 == ~n); 19834#L20 call #t~ret0 := fibonacci(~n - 1);< 19837#fibonacciENTRY ~n := #in~n; 19836#L15 assume !(~n < 1); 19835#L17 assume !(1 == ~n); 19830#L20 call #t~ret0 := fibonacci(~n - 1);< 19833#fibonacciENTRY ~n := #in~n; 19832#L15 assume !(~n < 1); 19831#L17 assume !(1 == ~n); 19826#L20 call #t~ret0 := fibonacci(~n - 1);< 19829#fibonacciENTRY ~n := #in~n; 19828#L15 assume !(~n < 1); 19827#L17 assume !(1 == ~n); 19820#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19821#fibonacciENTRY ~n := #in~n; 20030#L15 assume !(~n < 1); 20029#L17 assume 1 == ~n;#res := 1; 20028#fibonacciFINAL assume true; 20025#fibonacciEXIT >#28#return; 20022#L20-1 call #t~ret1 := fibonacci(~n - 2);< 20024#fibonacciENTRY ~n := #in~n; 20039#L15 assume ~n < 1;#res := 0; 20036#fibonacciFINAL assume true; 20021#fibonacciEXIT >#30#return; 20020#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20019#fibonacciFINAL assume true; 20013#fibonacciEXIT >#28#return; 19926#L20-1 call #t~ret1 := fibonacci(~n - 2);< 19929#fibonacciENTRY ~n := #in~n; 20016#L15 assume !(~n < 1); 20014#L17 assume !(1 == ~n); 20015#L20 call #t~ret0 := fibonacci(~n - 1);< 20052#fibonacciENTRY ~n := #in~n; 20063#L15 assume !(~n < 1); 20077#L17 assume !(1 == ~n); 19813#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-15 23:43:41,722 INFO L793 eck$LassoCheckResult]: Loop: 19810#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-15 23:43:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1106126005, now seen corresponding path program 5 times [2019-11-15 23:43:41,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:41,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908058486] [2019-11-15 23:43:41,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:41,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:41,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 195 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:43:42,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908058486] [2019-11-15 23:43:42,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820774555] [2019-11-15 23:43:42,010 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:42,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-15 23:43:42,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:42,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:43:42,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 142 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-15 23:43:42,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:42,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 25 [2019-11-15 23:43:42,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514461930] [2019-11-15 23:43:42,165 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:43:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 5 times [2019-11-15 23:43:42,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:42,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399167308] [2019-11-15 23:43:42,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:42,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:42,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:42,172 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:42,223 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:42,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:42,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:42,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:42,224 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:43:42,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:42,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:42,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:42,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-15 23:43:42,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:42,224 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:42,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:42,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:42,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:42,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:42,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:42,277 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:42,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:42,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:42,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:42,284 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:42,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:42,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:42,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:43:42,292 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:42,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:43:42,298 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35bb293a-5a9d-4be9-a004-fc74ac4c117b/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:42,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:43:42,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:43:52,673 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:43:52,675 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:43:52,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:43:52,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:43:52,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:43:52,675 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:43:52,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:43:52,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:43:52,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:43:52,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-15 23:43:52,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:43:52,676 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:43:52,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:52,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:52,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:52,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:43:52,720 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:43:52,720 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:43:52,720 INFO L120 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 [2019-11-15 23:43:52,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:52,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:52,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:52,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:52,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:52,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:52,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:52,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:52,721 INFO L120 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 [2019-11-15 23:43:52,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:52,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:52,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:52,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:52,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:52,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:52,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:52,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:43:52,723 INFO L120 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 [2019-11-15 23:43:52,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:43:52,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:43:52,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:43:52,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:43:52,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:43:52,724 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:43:52,724 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:43:52,725 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:43:52,726 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:43:52,726 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:43:52,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:43:52,726 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:43:52,726 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:43:52,726 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-15 23:43:52,727 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:43:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:52,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:43:52,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:52,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:52,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:52,925 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 [2019-11-15 23:43:52,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-15 23:43:52,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 350 states and 442 transitions. Complement of second has 18 states. [2019-11-15 23:43:52,996 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 [2019-11-15 23:43:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:43:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-15 23:43:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:52,997 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:53,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:43:53,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:53,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:53,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:53,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:53,166 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 [2019-11-15 23:43:53,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-15 23:43:53,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 356 states and 448 transitions. Complement of second has 17 states. [2019-11-15 23:43:53,254 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 [2019-11-15 23:43:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:43:53,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-15 23:43:53,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:53,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:43:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:53,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:43:53,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:53,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:43:53,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:53,443 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 [2019-11-15 23:43:53,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-15 23:43:53,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 455 states and 575 transitions. Complement of second has 27 states. [2019-11-15 23:43:53,529 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 [2019-11-15 23:43:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:43:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:43:53,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-15 23:43:53,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:53,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 63 letters. Loop has 4 letters. [2019-11-15 23:43:53,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:53,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 8 letters. [2019-11-15 23:43:53,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:43:53,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 575 transitions. [2019-11-15 23:43:53,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:43:53,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 336 states and 429 transitions. [2019-11-15 23:43:53,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-11-15 23:43:53,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-15 23:43:53,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 429 transitions. [2019-11-15 23:43:53,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:43:53,543 INFO L688 BuchiCegarLoop]: Abstraction has 336 states and 429 transitions. [2019-11-15 23:43:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 429 transitions. [2019-11-15 23:43:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 328. [2019-11-15 23:43:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-15 23:43:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-15 23:43:53,553 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-15 23:43:53,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:43:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:43:53,554 INFO L87 Difference]: Start difference. First operand 328 states and 419 transitions. Second operand 25 states. [2019-11-15 23:43:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:54,205 INFO L93 Difference]: Finished difference Result 426 states and 559 transitions. [2019-11-15 23:43:54,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:43:54,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 559 transitions. [2019-11-15 23:43:54,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:43:54,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 0 states and 0 transitions. [2019-11-15 23:43:54,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:43:54,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:43:54,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:43:54,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:43:54,212 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:43:54,212 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:43:54,212 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:43:54,212 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:43:54,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:43:54,212 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:43:54,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:43:54,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:43:54 BoogieIcfgContainer [2019-11-15 23:43:54,219 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:43:54,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:43:54,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:43:54,220 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:43:54,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:24" (3/4) ... [2019-11-15 23:43:54,237 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:43:54,237 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:43:54,239 INFO L168 Benchmark]: Toolchain (without parser) took 30104.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.9 MB). Free memory was 936.9 MB in the beginning and 855.2 MB in the end (delta: 81.7 MB). Peak memory consumption was 348.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,239 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:54,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,246 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,249 INFO L168 Benchmark]: RCFGBuilder took 251.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,249 INFO L168 Benchmark]: BuchiAutomizer took 29389.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 855.2 MB in the end (delta: 269.8 MB). Peak memory consumption was 386.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:54,249 INFO L168 Benchmark]: Witness Printer took 17.65 ms. Allocated memory is still 1.3 GB. Free memory is still 855.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:54,252 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 251.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29389.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 855.2 MB in the end (delta: 269.8 MB). Peak memory consumption was 386.7 MB. Max. memory is 11.5 GB. * Witness Printer took 17.65 ms. Allocated memory is still 1.3 GB. Free memory is still 855.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 (9 trivial, 3 deterministic, 4 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 9 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 9 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. 9 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.3s and 11 iterations. TraceHistogramMax:13. Analysis of lassos took 20.2s. Construction of modules took 2.6s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 328 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 813 states and ocurred in iteration 8. Nontrivial modules had stage [2, 1, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/46 HoareTripleCheckerStatistics: 324 SDtfs, 913 SDslu, 818 SDs, 0 SdLazy, 2689 SolverSat, 728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 14.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...