./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_5-2.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_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_5-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:55:30,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:55:30,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:55:30,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:55:30,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:55:30,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:55:30,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:55:30,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:55:30,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:55:30,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:55:30,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:55:30,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:55:30,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:55:30,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:55:30,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:55:30,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:55:30,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:55:30,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:55:30,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:55:30,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:55:30,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:55:30,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:55:30,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:55:30,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:55:30,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:55:30,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:55:30,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:55:30,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:55:30,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:55:30,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:55:30,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:55:30,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:55:30,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:55:30,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:55:30,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:55:30,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:55:30,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:55:30,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:55:30,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:55:30,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:55:30,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:55:30,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:55:30,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:55:30,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:55:30,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:55:30,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:55:30,861 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:55:30,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:55:30,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:55:30,862 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:55:30,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:55:30,862 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:55:30,862 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:55:30,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:55:30,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:55:30,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:55:30,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:55:30,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:55:30,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:55:30,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:55:30,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:55:30,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:55:30,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:55:30,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:55:30,866 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:55:30,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:55:30,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:55:30,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:55:30,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:55:30,867 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:55:30,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:55:30,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:55:30,868 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:55:30,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:55:30,869 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_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2019-11-15 20:55:30,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:55:30,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:55:30,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:55:30,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:55:30,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:55:30,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_5-2.c [2019-11-15 20:55:30,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/data/afbb93ef6/485478c3636747689314415f0440194c/FLAGbaa8f541a [2019-11-15 20:55:31,322 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:55:31,323 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/sv-benchmarks/c/recursive-simple/fibo_5-2.c [2019-11-15 20:55:31,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/data/afbb93ef6/485478c3636747689314415f0440194c/FLAGbaa8f541a [2019-11-15 20:55:31,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/data/afbb93ef6/485478c3636747689314415f0440194c [2019-11-15 20:55:31,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:55:31,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:55:31,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:55:31,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:55:31,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:55:31,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:55:31" (1/1) ... [2019-11-15 20:55:31,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db8532c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:31, skipping insertion in model container [2019-11-15 20:55:31,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:55:31" (1/1) ... [2019-11-15 20:55:31,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:55:31,834 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:55:32,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:55:32,116 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:55:32,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:55:32,147 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:55:32,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32 WrapperNode [2019-11-15 20:55:32,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:55:32,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:55:32,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:55:32,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:55:32,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:55:32,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:55:32,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:55:32,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:55:32,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... [2019-11-15 20:55:32,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:55:32,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:55:32,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:55:32,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:55:32,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:55:32,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:55:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-15 20:55:32,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-15 20:55:32,408 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:55:32,408 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:55:32,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:32 BoogieIcfgContainer [2019-11-15 20:55:32,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:55:32,410 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:55:32,410 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:55:32,413 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:55:32,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:55:32,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:55:31" (1/3) ... [2019-11-15 20:55:32,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37d1a500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:55:32, skipping insertion in model container [2019-11-15 20:55:32,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:55:32,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:55:32" (2/3) ... [2019-11-15 20:55:32,416 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37d1a500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:55:32, skipping insertion in model container [2019-11-15 20:55:32,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:55:32,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:32" (3/3) ... [2019-11-15 20:55:32,417 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_5-2.c [2019-11-15 20:55:32,459 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:55:32,460 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:55:32,460 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:55:32,460 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:55:32,460 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:55:32,460 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:55:32,460 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:55:32,460 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:55:32,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:55:32,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:32,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:32,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:32,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:55:32,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:55:32,551 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:55:32,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:55:32,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:32,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:32,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:32,554 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:55:32,554 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:55:32,574 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-11-15 20:55:32,575 INFO L793 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-11-15 20:55:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-11-15 20:55:32,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:32,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971821885] [2019-11-15 20:55:32,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-11-15 20:55:32,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:32,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656546680] [2019-11-15 20:55:32,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-11-15 20:55:32,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:32,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332069142] [2019-11-15 20:55:32,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:32,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:32,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:32,835 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:32,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:32,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:32,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:32,836 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:55:32,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:32,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:32,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:32,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration1_Loop [2019-11-15 20:55:32,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:32,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:32,854 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 20:55:32,864 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 20:55:32,867 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 20:55:32,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 20:55:32,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 20:55:32,949 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:32,949 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:32,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:32,957 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 20:55:32,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:32,966 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:32,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:32,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:32,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:32,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:32,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:32,999 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 20:55:33,005 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:33,005 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:33,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:33,018 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:33,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:33,025 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:33,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:33,047 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_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:33,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:55:33,072 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:33,087 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:55:33,089 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:33,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:33,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:33,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:33,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:55:33,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:33,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:33,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:33,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration1_Loop [2019-11-15 20:55:33,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:33,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:33,092 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 20:55:33,100 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 20:55:33,105 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 20:55:33,110 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 20:55:33,113 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 20:55:33,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:33,180 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:55:33,182 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 20:55:33,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:33,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:33,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:33,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:33,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:33,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:33,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:33,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:33,191 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 20:55:33,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:33,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:33,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:33,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:33,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:33,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:33,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:33,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:33,197 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 20:55:33,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:33,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:33,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:33,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:33,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:33,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:33,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:33,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:33,213 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 20:55:33,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:33,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:33,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:33,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:33,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:33,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:33,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:33,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:33,217 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 20:55:33,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:33,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:33,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:33,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:33,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:33,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:33,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:33,225 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:55:33,231 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:55:33,231 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:55:33,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:55:33,233 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:55:33,233 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:55:33,234 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 20:55:33,236 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:55:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:55:33,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:55:33,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:33,331 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 20:55:33,345 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 20:55:33,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-11-15 20:55:33,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-11-15 20:55:33,459 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 20:55:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:55:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 20:55:33,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 20:55:33,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:33,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 20:55:33,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:33,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 20:55:33,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:33,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-11-15 20:55:33,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:33,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-11-15 20:55:33,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:55:33,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:55:33,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 20:55:33,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:33,481 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:55:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 20:55:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 20:55:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:55:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 20:55:33,510 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:55:33,510 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:55:33,510 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:55:33,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 20:55:33,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:33,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:33,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:33,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:33,513 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:33,513 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 20:55:33,513 INFO L793 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 20:55:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:33,514 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-11-15 20:55:33,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:33,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931306832] [2019-11-15 20:55:33,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,598 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 20:55:33,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931306832] [2019-11-15 20:55:33,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184899927] [2019-11-15 20:55:33,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:55:33,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:33,653 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 20:55:33,653 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:33,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:55:33,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545001951] [2019-11-15 20:55:33,656 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:55:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:33,656 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-11-15 20:55:33,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:33,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676982792] [2019-11-15 20:55:33,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,714 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 20:55:33,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676982792] [2019-11-15 20:55:33,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:55:33,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:55:33,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335831588] [2019-11-15 20:55:33,715 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:55:33,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:55:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:55:33,719 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 20:55:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:33,822 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-15 20:55:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:55:33,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 20:55:33,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:33,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-15 20:55:33,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 20:55:33,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 20:55:33,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 20:55:33,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:33,827 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:55:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 20:55:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 20:55:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:55:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 20:55:33,831 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:55:33,832 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:55:33,832 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:55:33,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 20:55:33,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:55:33,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:33,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:33,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:33,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:33,834 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 221#L25 call main_#t~ret2 := fibo(main_~x~0);< 225#fiboENTRY ~n := #in~n; 226#L6 assume !(~n < 1); 224#L8 assume !(1 == ~n); 218#L11 call #t~ret0 := fibo(~n - 1);< 227#fiboENTRY ~n := #in~n; 228#L6 assume !(~n < 1); 222#L8 assume 1 == ~n;#res := 1; 223#fiboFINAL assume true; 217#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 20:55:33,834 INFO L793 eck$LassoCheckResult]: Loop: 219#L11-1 call #t~ret1 := fibo(~n - 2);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume !(1 == ~n); 230#L11 call #t~ret0 := fibo(~n - 1);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume 1 == ~n;#res := 1; 236#fiboFINAL assume true; 234#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 20:55:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-11-15 20:55:33,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:33,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276426825] [2019-11-15 20:55:33,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,900 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 20:55:33,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276426825] [2019-11-15 20:55:33,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829921742] [2019-11-15 20:55:33,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:33,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:55:33,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:33,946 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 20:55:33,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:33,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:55:33,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955096456] [2019-11-15 20:55:33,947 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:55:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-11-15 20:55:33,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:33,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792266881] [2019-11-15 20:55:33,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:33,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:33,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:34,095 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:34,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:34,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:34,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:34,095 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:55:34,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:34,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:34,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:34,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration3_Loop [2019-11-15 20:55:34,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:34,096 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:34,097 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 20:55:34,116 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 20:55:34,122 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 20:55:34,124 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 20:55:34,179 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:34,179 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:34,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:34,188 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:34,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:55:34,207 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:34,679 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:55:34,681 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:34,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:34,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:34,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:34,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:55:34,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:34,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:34,683 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:34,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration3_Loop [2019-11-15 20:55:34,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:34,683 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:34,684 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 20:55:34,693 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 20:55:34,707 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 20:55:34,709 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 20:55:34,769 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:34,769 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:55:34,769 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 20:55:34,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:34,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:34,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:34,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:34,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:34,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:34,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:34,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:34,775 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 20:55:34,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:34,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:34,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:34,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:34,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:34,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:34,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:34,795 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:55:34,811 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:55:34,811 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:55:34,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:55:34,812 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:55:34,812 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:55:34,812 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:55:34,813 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:55:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:34,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:55:34,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:34,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:55:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:34,983 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 20:55:34,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-15 20:55:34,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 20:55:35,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-11-15 20:55:35,196 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 20:55:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:55:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-15 20:55:35,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 20:55:35,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:35,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-15 20:55:35,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:35,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-11-15 20:55:35,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:35,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-15 20:55:35,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:55:35,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-15 20:55:35,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 20:55:35,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:55:35,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-15 20:55:35,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:35,235 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-15 20:55:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-15 20:55:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-15 20:55:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:55:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-15 20:55:35,258 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-15 20:55:35,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:55:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:55:35,259 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-15 20:55:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:35,351 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-15 20:55:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:55:35,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-15 20:55:35,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:55:35,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-15 20:55:35,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 20:55:35,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:55:35,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-15 20:55:35,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:35,362 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-15 20:55:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-15 20:55:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 20:55:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 20:55:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 20:55:35,375 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:55:35,375 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 20:55:35,375 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:55:35,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-15 20:55:35,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:55:35,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:35,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:35,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:35,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-15 20:55:35,380 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 745#L25 call main_#t~ret2 := fibo(main_~x~0);< 769#fiboENTRY ~n := #in~n; 793#L6 assume !(~n < 1); 752#L8 assume !(1 == ~n); 753#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 762#L6 assume !(~n < 1); 796#L8 assume 1 == ~n;#res := 1; 795#fiboFINAL assume true; 794#fiboEXIT >#32#return; 757#L11-1 call #t~ret1 := fibo(~n - 2);< 756#fiboENTRY ~n := #in~n; 758#L6 assume ~n < 1;#res := 0; 823#fiboFINAL assume true; 817#fiboEXIT >#34#return; 814#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 812#fiboFINAL assume true; 802#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 20:55:35,380 INFO L793 eck$LassoCheckResult]: Loop: 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume ~n < 1;#res := 0; 819#fiboFINAL assume true; 821#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 20:55:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-11-15 20:55:35,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:35,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266332766] [2019-11-15 20:55:35,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:35,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:35,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,517 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 20:55:35,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266332766] [2019-11-15 20:55:35,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357803775] [2019-11-15 20:55:35,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:55:35,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:35,576 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 20:55:35,577 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:35,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-15 20:55:35,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66749845] [2019-11-15 20:55:35,578 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:55:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-11-15 20:55:35,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:35,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122493429] [2019-11-15 20:55:35,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:35,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,689 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 20:55:35,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122493429] [2019-11-15 20:55:35,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350978301] [2019-11-15 20:55:35,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:35,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:55:35,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:35,770 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 20:55:35,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:35,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 20:55:35,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592031623] [2019-11-15 20:55:35,771 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:55:35,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:55:35,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:55:35,772 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-15 20:55:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:35,984 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2019-11-15 20:55:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:55:35,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 158 transitions. [2019-11-15 20:55:35,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 20:55:35,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 156 transitions. [2019-11-15 20:55:35,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-15 20:55:35,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 20:55:35,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 156 transitions. [2019-11-15 20:55:35,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:35,993 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 20:55:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 156 transitions. [2019-11-15 20:55:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 20:55:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 20:55:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2019-11-15 20:55:36,005 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 20:55:36,005 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 20:55:36,005 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:55:36,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 156 transitions. [2019-11-15 20:55:36,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 20:55:36,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:36,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:36,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:55:36,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 20:55:36,010 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 1249#L25 call main_#t~ret2 := fibo(main_~x~0);< 1278#fiboENTRY ~n := #in~n; 1308#L6 assume !(~n < 1); 1307#L8 assume !(1 == ~n); 1256#L11 call #t~ret0 := fibo(~n - 1);< 1273#fiboENTRY ~n := #in~n; 1274#L6 assume !(~n < 1); 1255#L8 assume !(1 == ~n); 1257#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1306#L6 assume !(~n < 1); 1304#L8 assume 1 == ~n;#res := 1; 1302#fiboFINAL assume true; 1300#fiboEXIT >#32#return; 1243#L11-1 call #t~ret1 := fibo(~n - 2);< 1298#fiboENTRY ~n := #in~n; 1345#L6 assume ~n < 1;#res := 0; 1344#fiboFINAL assume true; 1342#fiboEXIT >#34#return; 1340#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1339#fiboFINAL assume true; 1332#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 20:55:36,010 INFO L793 eck$LassoCheckResult]: Loop: 1260#L11-1 call #t~ret1 := fibo(~n - 2);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume 1 == ~n;#res := 1; 1254#fiboFINAL assume true; 1346#fiboEXIT >#32#return; 1252#L11-1 call #t~ret1 := fibo(~n - 2);< 1271#fiboENTRY ~n := #in~n; 1272#L6 assume ~n < 1;#res := 0; 1310#fiboFINAL assume true; 1347#fiboEXIT >#34#return; 1244#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1258#fiboFINAL assume true; 1264#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 20:55:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-11-15 20:55:36,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:36,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490759213] [2019-11-15 20:55:36,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:36,026 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-11-15 20:55:36,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:36,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404845240] [2019-11-15 20:55:36,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:36,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash 560101880, now seen corresponding path program 3 times [2019-11-15 20:55:36,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:36,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034776170] [2019-11-15 20:55:36,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:36,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 52 proven. 67 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 20:55:36,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034776170] [2019-11-15 20:55:36,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798957148] [2019-11-15 20:55:36,192 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:36,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 20:55:36,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:55:36,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:55:36,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:55:36,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:36,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-15 20:55:36,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858864470] [2019-11-15 20:55:36,554 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:36,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:36,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:36,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:36,555 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:55:36,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:36,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:36,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:36,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration5_Loop [2019-11-15 20:55:36,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:36,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:36,556 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 20:55:36,564 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 20:55:36,566 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 20:55:36,574 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 20:55:36,658 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:36,658 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:36,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:36,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:36,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:36,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:36,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:36,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:36,673 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:36,673 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:36,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:36,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:36,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:36,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=1} Honda state: {fibo_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:36,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:36,690 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:36,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:55:36,707 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:37,241 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:55:37,243 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:37,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:37,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:37,243 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:37,243 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:55:37,243 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:37,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:37,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:37,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration5_Loop [2019-11-15 20:55:37,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:37,244 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:37,244 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 20:55:37,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 20:55:37,249 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 20:55:37,260 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 20:55:37,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:37,323 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:55:37,323 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 20:55:37,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:37,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:37,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:37,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:37,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:37,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:37,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:37,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:37,327 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 20:55:37,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:37,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:37,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:37,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:37,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:37,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:37,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:37,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:37,329 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 20:55:37,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:37,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:37,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:37,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:37,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:37,330 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:37,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:37,334 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:55:37,337 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:55:37,337 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:55:37,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:55:37,337 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:55:37,337 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:55:37,339 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 20:55:37,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:55:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:37,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:55:37,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:37,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:37,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:55:37,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:37,598 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 20:55:37,600 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 20:55:37,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 20:55:37,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 182 states and 248 transitions. Complement of second has 33 states. [2019-11-15 20:55:37,844 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 20:55:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:55:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 20:55:37,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:55:37,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:37,846 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:55:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:37,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:55:37,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:37,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:37,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:37,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:55:37,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:37,995 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 20:55:37,995 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 20:55:37,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 20:55:38,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 307 states and 417 transitions. Complement of second has 25 states. [2019-11-15 20:55:38,182 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 20:55:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:55:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 20:55:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:55:38,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:38,183 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:55:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:38,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:55:38,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:38,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:38,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:55:38,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:38,402 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 20:55:38,403 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 20:55:38,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 20:55:38,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 1077 states and 1514 transitions. Complement of second has 130 states. [2019-11-15 20:55:38,638 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 20:55:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:55:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 20:55:38,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 20:55:38,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:38,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-11-15 20:55:38,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:38,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-11-15 20:55:38,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:38,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1514 transitions. [2019-11-15 20:55:38,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-15 20:55:38,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 937 transitions. [2019-11-15 20:55:38,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-15 20:55:38,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-11-15 20:55:38,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 937 transitions. [2019-11-15 20:55:38,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:38,710 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 937 transitions. [2019-11-15 20:55:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 937 transitions. [2019-11-15 20:55:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 475. [2019-11-15 20:55:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-15 20:55:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 723 transitions. [2019-11-15 20:55:38,778 INFO L711 BuchiCegarLoop]: Abstraction has 475 states and 723 transitions. [2019-11-15 20:55:38,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:55:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:55:38,779 INFO L87 Difference]: Start difference. First operand 475 states and 723 transitions. Second operand 16 states. [2019-11-15 20:55:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:39,143 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2019-11-15 20:55:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:55:39,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 188 transitions. [2019-11-15 20:55:39,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:55:39,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 188 transitions. [2019-11-15 20:55:39,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2019-11-15 20:55:39,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-15 20:55:39,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 188 transitions. [2019-11-15 20:55:39,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:55:39,149 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2019-11-15 20:55:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 188 transitions. [2019-11-15 20:55:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-11-15 20:55:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 20:55:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-11-15 20:55:39,153 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-11-15 20:55:39,154 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-11-15 20:55:39,154 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:55:39,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 142 transitions. [2019-11-15 20:55:39,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:55:39,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:55:39,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:55:39,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-11-15 20:55:39,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:55:39,158 INFO L791 eck$LassoCheckResult]: Stem: 4528#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 4529#L25 call main_#t~ret2 := fibo(main_~x~0);< 4551#fiboENTRY ~n := #in~n; 4549#L6 assume !(~n < 1); 4550#L8 assume !(1 == ~n); 4540#L11 call #t~ret0 := fibo(~n - 1);< 4539#fiboENTRY ~n := #in~n; 4541#L6 assume !(~n < 1); 4574#L8 assume !(1 == ~n); 4533#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4572#L6 assume !(~n < 1); 4532#L8 assume !(1 == ~n); 4534#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4572#L6 assume !(~n < 1); 4532#L8 assume !(1 == ~n); 4534#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4573#L6 assume !(~n < 1); 4610#L8 assume 1 == ~n;#res := 1; 4609#fiboFINAL assume true; 4608#fiboEXIT >#32#return; 4605#L11-1 call #t~ret1 := fibo(~n - 2);< 4607#fiboENTRY ~n := #in~n; 4629#L6 assume ~n < 1;#res := 0; 4627#fiboFINAL assume true; 4625#fiboEXIT >#34#return; 4624#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 4623#fiboFINAL assume true; 4595#fiboEXIT >#32#return; 4576#L11-1 call #t~ret1 := fibo(~n - 2);< 4587#fiboENTRY ~n := #in~n; 4628#L6 assume ~n < 1;#res := 0; 4626#fiboFINAL assume true; 4585#fiboEXIT >#34#return; 4583#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 4581#fiboFINAL assume true; 4575#fiboEXIT >#32#return; 4562#L11-1 call #t~ret1 := fibo(~n - 2);< 4568#fiboENTRY ~n := #in~n; 4567#L6 assume !(~n < 1); 4564#L8 assume !(1 == ~n); 4566#L11 call #t~ret0 := fibo(~n - 1);< 4620#fiboENTRY ~n := #in~n; 4633#L6 assume !(~n < 1); 4634#L8 assume !(1 == ~n); 4520#L11 call #t~ret0 := fibo(~n - 1);< 4547#fiboENTRY [2019-11-15 20:55:39,158 INFO L793 eck$LassoCheckResult]: Loop: 4547#fiboENTRY ~n := #in~n; 4636#L6 assume !(~n < 1); 4631#L8 assume !(1 == ~n); 4519#L11 call #t~ret0 := fibo(~n - 1);< 4547#fiboENTRY [2019-11-15 20:55:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -918730881, now seen corresponding path program 4 times [2019-11-15 20:55:39,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:39,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442992883] [2019-11-15 20:55:39,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:39,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:39,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 20:55:39,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442992883] [2019-11-15 20:55:39,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153717546] [2019-11-15 20:55:39,381 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:55:39,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:55:39,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:55:39,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:55:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 20:55:39,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:55:39,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-15 20:55:39,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985045230] [2019-11-15 20:55:39,549 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:55:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-11-15 20:55:39,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:55:39,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914760949] [2019-11-15 20:55:39,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:39,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:55:39,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:55:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:55:39,558 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:55:39,591 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:39,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:39,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:39,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:39,591 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:55:39,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:39,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:39,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:39,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration6_Loop [2019-11-15 20:55:39,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:39,591 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:39,592 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 20:55:39,606 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 20:55:39,607 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 20:55:39,609 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 20:55:39,615 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 20:55:39,665 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:39,665 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:39,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:39,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:39,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:39,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:39,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:39,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:39,680 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:39,680 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:39,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:39,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:55:39,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:55:39,689 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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 20:55:39,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:55:39,694 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6b835c8-4e90-4a10-aeb5-064907c4a3ea/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) [2019-11-15 20:55:39,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:55:39,712 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:39,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:55:39,757 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:55:39,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:55:39,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:55:39,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:55:39,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:55:39,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:55:39,758 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:55:39,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:55:39,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-2.c_Iteration6_Loop [2019-11-15 20:55:39,758 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:55:39,758 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:55:39,759 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 20:55:39,761 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 20:55:39,763 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 20:55:39,766 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 20:55:39,788 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 20:55:39,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:55:39,824 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:55:39,824 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 20:55:39,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:39,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:39,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:39,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:39,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:39,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:39,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:39,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:39,826 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 20:55:39,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:39,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:39,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:39,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:39,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:39,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:39,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:39,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:39,828 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 20:55:39,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:39,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:39,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:39,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:39,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:39,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:39,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:39,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:55:39,830 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 20:55:39,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:55:39,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:55:39,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:55:39,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:55:39,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:55:39,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:55:39,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:55:39,833 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:55:39,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:55:39,834 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:55:39,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:55:39,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:55:39,835 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:55:39,835 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 20:55:39,835 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:55:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:55:39,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:39,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:39,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:55:39,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:39,977 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 20:55:39,977 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 20:55:39,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 20:55:40,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 131 states and 152 transitions. Complement of second has 13 states. [2019-11-15 20:55:40,052 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 20:55:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:55:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 20:55:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 20:55:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:40,053 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:55:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:55:40,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:40,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:55:40,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:40,191 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 20:55:40,191 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 20:55:40,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 20:55:40,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 131 states and 152 transitions. Complement of second has 13 states. [2019-11-15 20:55:40,254 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 20:55:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:55:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 20:55:40,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 20:55:40,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:40,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:55:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:55:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:40,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:55:40,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:40,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:55:40,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:55:40,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:55:40,401 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 20:55:40,401 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 20:55:40,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 20:55:40,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 170 states and 193 transitions. Complement of second has 14 states. [2019-11-15 20:55:40,492 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 20:55:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:55:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 20:55:40,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 20:55:40,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:40,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 52 letters. Loop has 4 letters. [2019-11-15 20:55:40,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:40,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 48 letters. Loop has 8 letters. [2019-11-15 20:55:40,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:55:40,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 193 transitions. [2019-11-15 20:55:40,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:55:40,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 0 states and 0 transitions. [2019-11-15 20:55:40,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:55:40,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:55:40,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:55:40,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:55:40,497 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:40,497 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:40,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:55:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 20:55:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:55:40,498 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 19 states. [2019-11-15 20:55:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:55:40,498 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 20:55:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:55:40,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:55:40,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:55:40,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:55:40,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:55:40,499 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:55:40,499 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:55:40,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:55:40,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:55:40,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:55:40,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:55:40 BoogieIcfgContainer [2019-11-15 20:55:40,506 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:55:40,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:55:40,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:55:40,507 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:55:40,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:55:32" (3/4) ... [2019-11-15 20:55:40,511 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:55:40,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:55:40,513 INFO L168 Benchmark]: Toolchain (without parser) took 8711.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -113.6 MB). Peak memory consumption was 80.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:40,513 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:55:40,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:40,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:55:40,515 INFO L168 Benchmark]: Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:55:40,515 INFO L168 Benchmark]: RCFGBuilder took 197.24 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:40,516 INFO L168 Benchmark]: BuchiAutomizer took 8096.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:55:40,516 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:55:40,519 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.24 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8096.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 7 iterations. TraceHistogramMax:9. Analysis of lassos took 4.2s. Construction of modules took 0.7s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 189 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 121 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 144 SDtfs, 387 SDslu, 153 SDs, 0 SdLazy, 699 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI2 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf93 smp79 dnf100 smp100 tf110 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...