./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:44,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:44,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:44,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:44,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:44,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:44,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:44,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:44,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:44,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:44,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:44,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:44,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:44,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:44,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:44,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:44,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:44,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:44,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:44,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:44,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:44,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:44,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:44,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:44,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:44,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:44,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:44,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:44,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:44,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:44,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:44,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:44,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:44,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:44,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:44,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:44,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:44,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:44,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:44,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:44,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:44,344 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:44,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:44,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:44,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:44,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:44,357 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:44,357 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:44,358 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:44,358 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:44,358 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:44,358 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:44,358 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:44,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:44,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:44,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:44,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:44,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:44,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:44,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:44,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:44,360 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:44,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:44,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:44,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:44,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:44,361 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:44,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:44,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:44,361 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:44,362 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:44,362 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/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-10-22 08:55:44,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:44,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:44,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:44,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:44,401 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:44,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-10-22 08:55:44,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/data/041f6763b/63eec051546c41529285cd02a6417a49/FLAGdf65cdb6d [2019-10-22 08:55:44,776 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:44,776 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-10-22 08:55:44,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/data/041f6763b/63eec051546c41529285cd02a6417a49/FLAGdf65cdb6d [2019-10-22 08:55:44,793 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/data/041f6763b/63eec051546c41529285cd02a6417a49 [2019-10-22 08:55:44,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:44,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:44,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:44,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:44,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:44,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c59f7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:44, skipping insertion in model container [2019-10-22 08:55:44,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:44" (1/1) ... [2019-10-22 08:55:44,810 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:44,822 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:44,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:44,947 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:45,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:45,027 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:45,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45 WrapperNode [2019-10-22 08:55:45,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:45,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:45,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:45,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:45,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:45,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:45,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:45,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:45,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... [2019-10-22 08:55:45,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:45,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:45,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:45,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:45,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-10-22 08:55:45,145 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-10-22 08:55:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-10-22 08:55:45,145 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-10-22 08:55:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:45,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:45,318 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:45,318 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:55:45,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45 BoogieIcfgContainer [2019-10-22 08:55:45,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:45,320 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:45,320 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:45,324 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:45,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:44" (1/3) ... [2019-10-22 08:55:45,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4870a4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:45, skipping insertion in model container [2019-10-22 08:55:45,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:45" (2/3) ... [2019-10-22 08:55:45,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4870a4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:45, skipping insertion in model container [2019-10-22 08:55:45,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:45,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45" (3/3) ... [2019-10-22 08:55:45,342 INFO L371 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-10-22 08:55:45,462 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:45,462 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:45,462 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:45,462 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:45,462 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:45,463 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:45,463 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:45,463 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:45,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:55:45,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:45,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:45,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,515 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:45,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:55:45,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:45,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:45,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:45,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:45,519 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,525 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 22#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2019-10-22 08:55:45,527 INFO L793 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j - 1);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 12#rec1EXITtrue >#33#return; 23#L20-1true call #t~ret4 := rec2(#t~ret3);< 3#rec2ENTRYtrue [2019-10-22 08:55:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-10-22 08:55:45,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425562945] [2019-10-22 08:55:45,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-10-22 08:55:45,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190427741] [2019-10-22 08:55:45,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1371489668, now seen corresponding path program 1 times [2019-10-22 08:55:45,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520140593] [2019-10-22 08:55:45,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:45,656 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:45,779 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:45,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:45,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:45,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:45,780 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:45,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:45,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:45,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2019-10-22 08:55:45,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:45,781 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:45,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,848 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:45,849 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:45,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:45,859 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-10-22 08:55:45,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:45,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:45,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:45,883 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:45,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:45,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:45,894 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-10-22 08:55:45,898 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:45,898 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:45,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:45,909 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:45,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:45,916 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:45,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:45,931 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:45,934 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:45,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:45,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:45,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:45,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:45,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:45,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:45,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:45,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2019-10-22 08:55:45,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:45,936 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:45,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,011 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,015 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:46,017 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-10-22 08:55:46,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,023 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,026 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-10-22 08:55:46,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,030 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-10-22 08:55:46,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,036 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-10-22 08:55:46,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,050 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:46,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:46,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:46,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:46,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:46,057 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:46,057 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-10-22 08:55:46,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:46,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:55:46,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:46,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-10-22 08:55:46,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-10-22 08:55:46,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2019-10-22 08:55:46,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 194 states and 279 transitions. Complement of second has 61 states. [2019-10-22 08:55:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:55:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2019-10-22 08:55:46,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 08:55:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 08:55:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 16 letters. [2019-10-22 08:55:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:46,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 279 transitions. [2019-10-22 08:55:46,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:46,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 82 states and 120 transitions. [2019-10-22 08:55:46,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-10-22 08:55:46,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-10-22 08:55:46,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 120 transitions. [2019-10-22 08:55:46,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:46,688 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 120 transitions. [2019-10-22 08:55:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 120 transitions. [2019-10-22 08:55:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2019-10-22 08:55:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 08:55:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2019-10-22 08:55:46,727 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-10-22 08:55:46,727 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-10-22 08:55:46,728 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:46,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 83 transitions. [2019-10-22 08:55:46,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:46,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:46,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:46,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:46,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:46,730 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 345#L25 call main_#t~ret6 := rec2(main_~x~0);< 344#rec2ENTRY ~j := #in~j; 347#L18 assume !(~j <= 0); 363#L20 call #t~ret3 := rec1(~j - 1);< 379#rec1ENTRY ~i := #in~i; 397#L12 assume !(~i <= 0); 351#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-10-22 08:55:46,730 INFO L793 eck$LassoCheckResult]: Loop: 350#rec1ENTRY ~i := #in~i; 358#L12 assume !(~i <= 0); 354#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-10-22 08:55:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-10-22 08:55:46,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223310297] [2019-10-22 08:55:46,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-10-22 08:55:46,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440778950] [2019-10-22 08:55:46,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,747 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-10-22 08:55:46,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219011986] [2019-10-22 08:55:46,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:46,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:46,782 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:46,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:46,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:46,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:46,783 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:46,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:46,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:46,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2019-10-22 08:55:46,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:46,784 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:46,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,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-10-22 08:55:46,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,825 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,825 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:46,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,832 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:46,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:46,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,846 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,850 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:46,850 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:46,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,858 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 [2019-10-22 08:55:46,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:46,868 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:46,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,876 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-10-22 08:55:46,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:46,882 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:46,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,891 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:46,894 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:46,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:46,903 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:46,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:46,915 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,923 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:46,925 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:46,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:46,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:46,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:46,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:46,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:46,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:46,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:46,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2019-10-22 08:55:46,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:46,926 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:46,979 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:46,979 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:46,980 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-10-22 08:55:46,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,986 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-10-22 08:55:46,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:46,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:46,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:46,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:46,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:46,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:46,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:46,989 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-10-22 08:55:46,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:46,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:47,004 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-10-22 08:55:47,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:47,008 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-10-22 08:55:47,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,022 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:47,026 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 08:55:47,028 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:47,028 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:47,029 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:47,029 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:47,029 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-10-22 08:55:47,029 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:47,101 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-10-22 08:55:47,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32 Second operand 4 states. [2019-10-22 08:55:47,160 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 105 states and 149 transitions. Complement of second has 13 states. [2019-10-22 08:55:47,161 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-10-22 08:55:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:55:47,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:55:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:55:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:55:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 149 transitions. [2019-10-22 08:55:47,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:47,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 93 states and 137 transitions. [2019-10-22 08:55:47,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-10-22 08:55:47,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-10-22 08:55:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 137 transitions. [2019-10-22 08:55:47,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,174 INFO L688 BuchiCegarLoop]: Abstraction has 93 states and 137 transitions. [2019-10-22 08:55:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 137 transitions. [2019-10-22 08:55:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-10-22 08:55:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:55:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2019-10-22 08:55:47,184 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-10-22 08:55:47,184 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-10-22 08:55:47,184 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:47,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 129 transitions. [2019-10-22 08:55:47,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:47,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:47,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:47,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,187 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:47,187 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 614#L25 call main_#t~ret6 := rec2(main_~x~0);< 620#rec2ENTRY ~j := #in~j; 633#L18 assume !(~j <= 0); 615#L20 call #t~ret3 := rec1(~j - 1);< 642#rec1ENTRY ~i := #in~i; 637#L12 assume !(~i <= 0); 577#L14 call #t~ret0 := rec1(~i - 2);< 576#rec1ENTRY ~i := #in~i; 579#L12 assume ~i <= 0;#res := 0; 583#rec1FINAL assume true; 584#rec1EXIT >#27#return; 593#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 595#rec1ENTRY [2019-10-22 08:55:47,187 INFO L793 eck$LassoCheckResult]: Loop: 595#rec1ENTRY ~i := #in~i; 632#L12 assume !(~i <= 0); 589#L14 call #t~ret0 := rec1(~i - 2);< 595#rec1ENTRY [2019-10-22 08:55:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-10-22 08:55:47,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496047239] [2019-10-22 08:55:47,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-10-22 08:55:47,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759428808] [2019-10-22 08:55:47,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-10-22 08:55:47,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149816793] [2019-10-22 08:55:47,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:55:47,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149816793] [2019-10-22 08:55:47,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:47,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:47,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129551323] [2019-10-22 08:55:47,318 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:47,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:47,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:47,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:47,319 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:47,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:47,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:47,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:47,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2019-10-22 08:55:47,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:47,319 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,354 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:47,354 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:47,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:47,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:47,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:47,367 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:47,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:47,375 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:47,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:47,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:47,431 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:47,432 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:47,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:47,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:47,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:47,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:47,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:47,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:47,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:47,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2019-10-22 08:55:47,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:47,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:47,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:47,484 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:47,484 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:47,484 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-10-22 08:55:47,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,485 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,486 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:47,487 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-10-22 08:55:47,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:47,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:47,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:47,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:47,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:47,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:47,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:47,494 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:47,499 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 08:55:47,500 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:47,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:47,500 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:47,501 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:47,501 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-10-22 08:55:47,501 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:47,593 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-10-22 08:55:47,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47 Second operand 5 states. [2019-10-22 08:55:47,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47. Second operand 5 states. Result 134 states and 193 transitions. Complement of second has 14 states. [2019-10-22 08:55:47,667 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-10-22 08:55:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-10-22 08:55:47,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:55:47,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2019-10-22 08:55:47,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 08:55:47,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:47,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 193 transitions. [2019-10-22 08:55:47,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:47,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 122 states and 181 transitions. [2019-10-22 08:55:47,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-10-22 08:55:47,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-10-22 08:55:47,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 181 transitions. [2019-10-22 08:55:47,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,676 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-10-22 08:55:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 181 transitions. [2019-10-22 08:55:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2019-10-22 08:55:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 08:55:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-10-22 08:55:47,686 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-10-22 08:55:47,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:47,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:47,690 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 6 states. [2019-10-22 08:55:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:47,729 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2019-10-22 08:55:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:47,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 175 transitions. [2019-10-22 08:55:47,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-10-22 08:55:47,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 121 states and 173 transitions. [2019-10-22 08:55:47,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-10-22 08:55:47,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-10-22 08:55:47,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 173 transitions. [2019-10-22 08:55:47,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,739 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 173 transitions. [2019-10-22 08:55:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 173 transitions. [2019-10-22 08:55:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-10-22 08:55:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-22 08:55:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2019-10-22 08:55:47,747 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-10-22 08:55:47,747 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-10-22 08:55:47,748 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:47,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 143 transitions. [2019-10-22 08:55:47,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 08:55:47,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:47,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:47,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,750 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,750 INFO L791 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1168#L25 call main_#t~ret6 := rec2(main_~x~0);< 1174#rec2ENTRY ~j := #in~j; 1185#L18 assume !(~j <= 0); 1146#L20 call #t~ret3 := rec1(~j - 1);< 1184#rec1ENTRY ~i := #in~i; 1183#L12 assume !(~i <= 0); 1156#L14 call #t~ret0 := rec1(~i - 2);< 1181#rec1ENTRY ~i := #in~i; 1179#L12 assume !(~i <= 0); 1161#L14 call #t~ret0 := rec1(~i - 2);< 1178#rec1ENTRY ~i := #in~i; 1180#L12 assume ~i <= 0;#res := 0; 1222#rec1FINAL assume true; 1166#rec1EXIT >#27#return; 1133#L14-1 [2019-10-22 08:55:47,750 INFO L793 eck$LassoCheckResult]: Loop: 1133#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1132#rec1ENTRY ~i := #in~i; 1135#L12 assume ~i <= 0;#res := 0; 1140#rec1FINAL assume true; 1141#rec1EXIT >#29#return; 1154#L14-2 call #t~ret2 := rec1(#t~ret1);< 1163#rec1ENTRY ~i := #in~i; 1204#L12 assume !(~i <= 0); 1157#L14 call #t~ret0 := rec1(~i - 2);< 1163#rec1ENTRY ~i := #in~i; 1204#L12 assume ~i <= 0;#res := 0; 1205#rec1FINAL assume true; 1213#rec1EXIT >#27#return; 1133#L14-1 [2019-10-22 08:55:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-10-22 08:55:47,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452689789] [2019-10-22 08:55:47,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-10-22 08:55:47,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378354731] [2019-10-22 08:55:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:55:47,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378354731] [2019-10-22 08:55:47,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804793063] [2019-10-22 08:55:47,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:55:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:47,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:47,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-10-22 08:55:47,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860452134] [2019-10-22 08:55:47,822 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:47,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:47,823 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-10-22 08:55:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:47,864 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2019-10-22 08:55:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:47,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 161 transitions. [2019-10-22 08:55:47,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:47,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 161 transitions. [2019-10-22 08:55:47,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-10-22 08:55:47,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-10-22 08:55:47,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 161 transitions. [2019-10-22 08:55:47,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:47,871 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 161 transitions. [2019-10-22 08:55:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 161 transitions. [2019-10-22 08:55:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-10-22 08:55:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 08:55:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2019-10-22 08:55:47,879 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-10-22 08:55:47,879 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-10-22 08:55:47,880 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:47,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. [2019-10-22 08:55:47,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:55:47,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:47,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:47,882 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,882 INFO L791 eck$LassoCheckResult]: Stem: 1445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1446#L25 call main_#t~ret6 := rec2(main_~x~0);< 1458#rec2ENTRY ~j := #in~j; 1471#L18 assume !(~j <= 0); 1422#L20 call #t~ret3 := rec1(~j - 1);< 1470#rec1ENTRY ~i := #in~i; 1469#L12 assume !(~i <= 0); 1418#L14 call #t~ret0 := rec1(~i - 2);< 1467#rec1ENTRY ~i := #in~i; 1440#L12 assume ~i <= 0;#res := 0; 1417#rec1FINAL assume true; 1419#rec1EXIT >#27#return; 1410#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1409#rec1ENTRY ~i := #in~i; 1412#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1509#rec1EXIT >#29#return; 1441#L14-2 call #t~ret2 := rec1(#t~ret1);< 1442#rec1ENTRY ~i := #in~i; 1510#L12 assume ~i <= 0;#res := 0; 1508#rec1FINAL assume true; 1505#rec1EXIT >#31#return; 1434#L14-3 #res := 1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;havoc #t~ret0; 1435#rec1FINAL assume true; 1464#rec1EXIT >#33#return; 1404#L20-1 [2019-10-22 08:55:47,883 INFO L793 eck$LassoCheckResult]: Loop: 1404#L20-1 call #t~ret4 := rec2(#t~ret3);< 1403#rec2ENTRY ~j := #in~j; 1405#L18 assume !(~j <= 0); 1452#L20 call #t~ret3 := rec1(~j - 1);< 1454#rec1ENTRY ~i := #in~i; 1512#L12 assume !(~i <= 0); 1447#L14 call #t~ret0 := rec1(~i - 2);< 1454#rec1ENTRY ~i := #in~i; 1512#L12 assume ~i <= 0;#res := 0; 1511#rec1FINAL assume true; 1507#rec1EXIT >#27#return; 1411#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1409#rec1ENTRY ~i := #in~i; 1412#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1509#rec1EXIT >#29#return; 1506#L14-2 call #t~ret2 := rec1(#t~ret1);< 1442#rec1ENTRY ~i := #in~i; 1510#L12 assume ~i <= 0;#res := 0; 1508#rec1FINAL assume true; 1505#rec1EXIT >#31#return; 1463#L14-3 #res := 1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;havoc #t~ret0; 1475#rec1FINAL assume true; 1461#rec1EXIT >#33#return; 1404#L20-1 [2019-10-22 08:55:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash -790062692, now seen corresponding path program 1 times [2019-10-22 08:55:47,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609839467] [2019-10-22 08:55:47,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 125202860, now seen corresponding path program 1 times [2019-10-22 08:55:47,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866343214] [2019-10-22 08:55:47,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:47,911 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2019382713, now seen corresponding path program 1 times [2019-10-22 08:55:47,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891584905] [2019-10-22 08:55:47,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-22 08:55:48,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891584905] [2019-10-22 08:55:48,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865909961] [2019-10-22 08:55:48,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-22 08:55:48,128 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:48,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-22 08:55:48,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374254261] [2019-10-22 08:55:48,341 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:48,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:48,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:48,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:48,341 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:48,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:48,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:48,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2019-10-22 08:55:48,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:48,342 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:48,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:48,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:48,389 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:48,398 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:48,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:48,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:51,011 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:51,013 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:51,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:51,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:51,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:51,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:51,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:51,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:51,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:51,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2019-10-22 08:55:51,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:51,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:51,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:51,068 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:51,068 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:51,068 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-10-22 08:55:51,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:51,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:51,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:51,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:51,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:51,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:51,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:51,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:51,071 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-10-22 08:55:51,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:51,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:51,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:51,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:51,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:51,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:51,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:51,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:51,073 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-10-22 08:55:51,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:51,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:51,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:51,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:51,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:51,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:51,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:51,079 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:51,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:51,082 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:51,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:51,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:51,083 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:51,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#t~ret3) = 1*rec2_#t~ret3 Supporting invariants [] [2019-10-22 08:55:51,084 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:51,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:55:51,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-10-22 08:55:51,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51 Second operand 11 states. [2019-10-22 08:55:51,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51. Second operand 11 states. Result 584 states and 903 transitions. Complement of second has 45 states. [2019-10-22 08:55:51,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2019-10-22 08:55:51,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 24 letters. [2019-10-22 08:55:51,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 49 letters. Loop has 24 letters. [2019-10-22 08:55:51,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 48 letters. [2019-10-22 08:55:51,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 903 transitions. [2019-10-22 08:55:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-10-22 08:55:51,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 432 states and 649 transitions. [2019-10-22 08:55:51,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-10-22 08:55:51,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2019-10-22 08:55:51,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 649 transitions. [2019-10-22 08:55:51,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:51,744 INFO L688 BuchiCegarLoop]: Abstraction has 432 states and 649 transitions. [2019-10-22 08:55:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 649 transitions. [2019-10-22 08:55:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 383. [2019-10-22 08:55:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-10-22 08:55:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 534 transitions. [2019-10-22 08:55:51,786 INFO L711 BuchiCegarLoop]: Abstraction has 383 states and 534 transitions. [2019-10-22 08:55:51,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:51,787 INFO L87 Difference]: Start difference. First operand 383 states and 534 transitions. Second operand 12 states. [2019-10-22 08:55:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:51,966 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-10-22 08:55:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:51,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 645 transitions. [2019-10-22 08:55:51,973 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-10-22 08:55:51,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 349 states and 495 transitions. [2019-10-22 08:55:51,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2019-10-22 08:55:51,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-10-22 08:55:51,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 495 transitions. [2019-10-22 08:55:51,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:51,984 INFO L688 BuchiCegarLoop]: Abstraction has 349 states and 495 transitions. [2019-10-22 08:55:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 495 transitions. [2019-10-22 08:55:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2019-10-22 08:55:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-22 08:55:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 415 transitions. [2019-10-22 08:55:52,004 INFO L711 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-10-22 08:55:52,004 INFO L591 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-10-22 08:55:52,004 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:52,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 415 transitions. [2019-10-22 08:55:52,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-10-22 08:55:52,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,008 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:52,008 INFO L791 eck$LassoCheckResult]: Stem: 3437#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 3438#L25 call main_#t~ret6 := rec2(main_~x~0);< 3454#rec2ENTRY ~j := #in~j; 3476#L18 assume !(~j <= 0); 3456#L20 call #t~ret3 := rec1(~j - 1);< 3474#rec1ENTRY ~i := #in~i; 3490#L12 assume !(~i <= 0); 3483#L14 call #t~ret0 := rec1(~i - 2);< 3489#rec1ENTRY ~i := #in~i; 3494#L12 assume ~i <= 0;#res := 0; 3548#rec1FINAL assume true; 3545#rec1EXIT >#27#return; 3540#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 3541#rec1ENTRY ~i := #in~i; 3544#L12 assume ~i <= 0;#res := 0; 3543#rec1FINAL assume true; 3539#rec1EXIT >#29#return; 3535#L14-2 call #t~ret2 := rec1(#t~ret1);< 3537#rec1ENTRY ~i := #in~i; 3542#L12 assume ~i <= 0;#res := 0; 3538#rec1FINAL assume true; 3536#rec1EXIT >#31#return; 3532#L14-3 #res := 1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;havoc #t~ret0; 3568#rec1FINAL assume true; 3455#rec1EXIT >#33#return; 3386#L20-1 call #t~ret4 := rec2(#t~ret3);< 3385#rec2ENTRY ~j := #in~j; 3387#L18 assume !(~j <= 0); 3521#L20 call #t~ret3 := rec1(~j - 1);< 3461#rec1ENTRY ~i := #in~i; 3567#L12 assume !(~i <= 0); 3423#L14 call #t~ret0 := rec1(~i - 2);< 3440#rec1ENTRY [2019-10-22 08:55:52,008 INFO L793 eck$LassoCheckResult]: Loop: 3440#rec1ENTRY ~i := #in~i; 3553#L12 assume !(~i <= 0); 3420#L14 call #t~ret0 := rec1(~i - 2);< 3440#rec1ENTRY [2019-10-22 08:55:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash -744961728, now seen corresponding path program 2 times [2019-10-22 08:55:52,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678426581] [2019-10-22 08:55:52,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:55:52,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678426581] [2019-10-22 08:55:52,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916004827] [2019-10-22 08:55:52,094 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:52,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:55:52,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 08:55:52,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:52,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-22 08:55:52,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411593166] [2019-10-22 08:55:52,153 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-10-22 08:55:52,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350896332] [2019-10-22 08:55:52,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,160 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,180 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:52,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:52,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:52,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:52,180 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:52,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:52,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:52,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:52,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2019-10-22 08:55:52,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:52,181 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:52,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,224 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:52,224 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:52,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:52,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:52,241 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:52,242 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/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-10-22 08:55:52,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:52,252 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:52,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:52,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:52,294 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:52,296 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:52,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:52,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:52,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:52,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:52,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:52,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:52,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:52,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2019-10-22 08:55:52,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:52,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:52,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:52,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:52,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:52,325 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-10-22 08:55:52,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:52,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:52,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:52,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:52,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:52,327 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:52,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:52,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:52,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-10-22 08:55:52,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:52,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:52,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:52,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:52,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:52,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:52,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:52,331 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:52,332 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 08:55:52,332 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:52,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:52,332 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:52,332 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:52,332 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-10-22 08:55:52,333 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,444 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-10-22 08:55:52,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 08:55:52,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-10-22 08:55:52,522 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-10-22 08:55:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-10-22 08:55:52,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-10-22 08:55:52,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,523 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,632 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-10-22 08:55:52,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 08:55:52,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-10-22 08:55:52,704 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-10-22 08:55:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-10-22 08:55:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-10-22 08:55:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,704 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:52,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,800 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-10-22 08:55:52,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 08:55:52,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 485 states and 616 transitions. Complement of second has 16 states. [2019-10-22 08:55:52,877 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-10-22 08:55:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-10-22 08:55:52,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-10-22 08:55:52,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2019-10-22 08:55:52,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2019-10-22 08:55:52,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:52,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 616 transitions. [2019-10-22 08:55:52,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 08:55:52,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 395 states and 526 transitions. [2019-10-22 08:55:52,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-10-22 08:55:52,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2019-10-22 08:55:52,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 526 transitions. [2019-10-22 08:55:52,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:52,895 INFO L688 BuchiCegarLoop]: Abstraction has 395 states and 526 transitions. [2019-10-22 08:55:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 526 transitions. [2019-10-22 08:55:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 351. [2019-10-22 08:55:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-22 08:55:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 456 transitions. [2019-10-22 08:55:52,912 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 456 transitions. [2019-10-22 08:55:52,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:52,913 INFO L87 Difference]: Start difference. First operand 351 states and 456 transitions. Second operand 10 states. [2019-10-22 08:55:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:53,020 INFO L93 Difference]: Finished difference Result 378 states and 513 transitions. [2019-10-22 08:55:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:53,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 513 transitions. [2019-10-22 08:55:53,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 08:55:53,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 104 states and 142 transitions. [2019-10-22 08:55:53,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-10-22 08:55:53,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2019-10-22 08:55:53,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 142 transitions. [2019-10-22 08:55:53,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:53,027 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-10-22 08:55:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 142 transitions. [2019-10-22 08:55:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-10-22 08:55:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-22 08:55:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-10-22 08:55:53,032 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-10-22 08:55:53,032 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-10-22 08:55:53,032 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:53,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 106 transitions. [2019-10-22 08:55:53,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 08:55:53,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:53,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:53,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:53,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:53,033 INFO L791 eck$LassoCheckResult]: Stem: 6182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6183#L25 call main_#t~ret6 := rec2(main_~x~0);< 6187#rec2ENTRY ~j := #in~j; 6215#L18 assume !(~j <= 0); 6212#L20 call #t~ret3 := rec1(~j - 1);< 6214#rec1ENTRY ~i := #in~i; 6213#L12 assume !(~i <= 0); 6172#L14 call #t~ret0 := rec1(~i - 2);< 6189#rec1ENTRY ~i := #in~i; 6177#L12 assume !(~i <= 0); 6170#L14 [2019-10-22 08:55:53,033 INFO L793 eck$LassoCheckResult]: Loop: 6170#L14 call #t~ret0 := rec1(~i - 2);< 6221#rec1ENTRY ~i := #in~i; 6177#L12 assume !(~i <= 0); 6170#L14 [2019-10-22 08:55:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1371444593, now seen corresponding path program 3 times [2019-10-22 08:55:53,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:53,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747626678] [2019-10-22 08:55:53,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,042 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash 54781, now seen corresponding path program 4 times [2019-10-22 08:55:53,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:53,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256762186] [2019-10-22 08:55:53,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1318041775, now seen corresponding path program 4 times [2019-10-22 08:55:53,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:53,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137910302] [2019-10-22 08:55:53,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:53,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:53,082 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:53,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:53,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:53,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:53,082 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:53,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:53,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:53,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2019-10-22 08:55:53,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:53,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:53,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,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-10-22 08:55:53,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,120 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:53,120 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:53,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:53,125 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:53,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:57,683 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:57,685 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:57,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:57,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:57,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:57,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:57,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:57,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:57,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2019-10-22 08:55:57,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:57,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:57,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:57,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-10-22 08:55:57,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:57,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:57,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:57,712 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:57,712 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:57,712 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-10-22 08:55:57,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,716 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:57,719 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:57,719 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:57,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:57,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:57,719 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:57,719 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2019-10-22 08:55:57,720 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:55:57,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:57,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:57,782 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-10-22 08:55:57,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-10-22 08:55:57,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 100 states and 124 transitions. Complement of second has 11 states. [2019-10-22 08:55:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-10-22 08:55:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:55:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:55:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:55:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2019-10-22 08:55:57,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 08:55:57,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 94 states and 117 transitions. [2019-10-22 08:55:57,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2019-10-22 08:55:57,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-10-22 08:55:57,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 117 transitions. [2019-10-22 08:55:57,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:57,817 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. [2019-10-22 08:55:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 117 transitions. [2019-10-22 08:55:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-10-22 08:55:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 08:55:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2019-10-22 08:55:57,820 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-10-22 08:55:57,820 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-10-22 08:55:57,821 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:57,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2019-10-22 08:55:57,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 08:55:57,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:57,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:57,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:57,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-10-22 08:55:57,824 INFO L791 eck$LassoCheckResult]: Stem: 6436#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6405#L25 call main_#t~ret6 := rec2(main_~x~0);< 6404#rec2ENTRY ~j := #in~j; 6406#L18 assume !(~j <= 0); 6439#L20 call #t~ret3 := rec1(~j - 1);< 6440#rec1ENTRY ~i := #in~i; 6461#L12 assume !(~i <= 0); 6424#L14 call #t~ret0 := rec1(~i - 2);< 6458#rec1ENTRY ~i := #in~i; 6475#L12 assume !(~i <= 0); 6408#L14 call #t~ret0 := rec1(~i - 2);< 6407#rec1ENTRY ~i := #in~i; 6409#L12 assume ~i <= 0;#res := 0; 6495#rec1FINAL assume true; 6493#rec1EXIT >#27#return; 6417#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6423#rec1ENTRY ~i := #in~i; 6489#L12 assume ~i <= 0;#res := 0; 6488#rec1FINAL assume true; 6466#rec1EXIT >#29#return; 6467#L14-2 call #t~ret2 := rec1(#t~ret1);< 6479#rec1ENTRY ~i := #in~i; 6485#L12 assume ~i <= 0;#res := 0; 6484#rec1FINAL assume true; 6477#rec1EXIT >#31#return; 6476#L14-3 #res := 1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;havoc #t~ret0; 6464#rec1FINAL assume true; 6465#rec1EXIT >#27#return; 6418#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6454#rec1ENTRY [2019-10-22 08:55:57,824 INFO L793 eck$LassoCheckResult]: Loop: 6454#rec1ENTRY ~i := #in~i; 6482#L12 assume !(~i <= 0); 6422#L14 call #t~ret0 := rec1(~i - 2);< 6437#rec1ENTRY ~i := #in~i; 6481#L12 assume !(~i <= 0); 6415#L14 call #t~ret0 := rec1(~i - 2);< 6438#rec1ENTRY ~i := #in~i; 6435#L12 assume ~i <= 0;#res := 0; 6414#rec1FINAL assume true; 6416#rec1EXIT >#27#return; 6417#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6423#rec1ENTRY ~i := #in~i; 6489#L12 assume ~i <= 0;#res := 0; 6488#rec1FINAL assume true; 6466#rec1EXIT >#29#return; 6467#L14-2 call #t~ret2 := rec1(#t~ret1);< 6479#rec1ENTRY ~i := #in~i; 6485#L12 assume ~i <= 0;#res := 0; 6484#rec1FINAL assume true; 6477#rec1EXIT >#31#return; 6476#L14-3 #res := 1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;havoc #t~ret0; 6464#rec1FINAL assume true; 6465#rec1EXIT >#27#return; 6419#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6454#rec1ENTRY [2019-10-22 08:55:57,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-10-22 08:55:57,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378875222] [2019-10-22 08:55:57,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:57,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash -165506564, now seen corresponding path program 1 times [2019-10-22 08:55:57,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371642389] [2019-10-22 08:55:57,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:57,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2126813793, now seen corresponding path program 2 times [2019-10-22 08:55:57,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993517974] [2019-10-22 08:55:57,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 43 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-22 08:55:57,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993517974] [2019-10-22 08:55:57,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536001885] [2019-10-22 08:55:57,960 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:58,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:55:58,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:58,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-22 08:55:58,015 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:58,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2019-10-22 08:55:58,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134321021] [2019-10-22 08:55:58,190 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:58,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:58,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:58,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:58,191 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:58,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:58,191 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:58,191 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2019-10-22 08:55:58,191 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:58,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:58,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,223 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:58,224 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:58,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:58,229 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:58,229 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:58,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:58,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:58,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:58,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:58,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:58,243 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:58,249 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d87281b8-9d7a-45e2-a99e-50d74b767f23/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:58,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:58,258 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:58,266 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:58,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:58,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:58,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:58,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:58,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:58,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:58,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:58,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2019-10-22 08:55:58,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:58,267 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:58,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:58,297 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:58,297 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:58,297 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-10-22 08:55:58,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:58,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:58,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:58,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:58,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:58,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:58,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:58,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:58,299 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-10-22 08:55:58,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:58,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:58,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:58,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:58,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:58,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:58,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:58,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:58,301 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-10-22 08:55:58,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:58,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:58,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:58,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:58,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:58,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:58,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:58,304 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:58,305 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:58,306 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:58,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:58,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:58,306 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:58,307 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-10-22 08:55:58,307 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:55:58,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-10-22 08:55:58,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-10-22 08:55:58,533 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-10-22 08:55:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:55:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-10-22 08:55:58,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:58,534 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:55:58,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-10-22 08:55:58,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-10-22 08:55:58,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-10-22 08:55:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:55:58,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-10-22 08:55:58,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:58,782 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:58,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:55:58,955 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 9 loop predicates [2019-10-22 08:55:58,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-10-22 08:55:59,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 257 states and 303 transitions. Complement of second has 31 states. [2019-10-22 08:55:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2019-10-22 08:55:59,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 29 letters. Loop has 24 letters. [2019-10-22 08:55:59,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:59,177 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:59,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:55:59,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:59,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:59,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:59,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:55:59,339 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-10-22 08:55:59,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-10-22 08:55:59,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 409 states and 515 transitions. Complement of second has 80 states. [2019-10-22 08:55:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2019-10-22 08:55:59,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 24 letters. [2019-10-22 08:55:59,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:59,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 53 letters. Loop has 24 letters. [2019-10-22 08:55:59,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:59,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 48 letters. [2019-10-22 08:55:59,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:59,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 515 transitions. [2019-10-22 08:55:59,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-10-22 08:55:59,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 253 states and 345 transitions. [2019-10-22 08:55:59,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-10-22 08:55:59,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2019-10-22 08:55:59,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 345 transitions. [2019-10-22 08:55:59,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:59,693 INFO L688 BuchiCegarLoop]: Abstraction has 253 states and 345 transitions. [2019-10-22 08:55:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 345 transitions. [2019-10-22 08:55:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2019-10-22 08:55:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-22 08:55:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2019-10-22 08:55:59,700 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 270 transitions. [2019-10-22 08:55:59,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:59,702 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand 11 states. [2019-10-22 08:55:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:59,776 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-10-22 08:55:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:55:59,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-10-22 08:55:59,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:59,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:59,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:59,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:59,777 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:55:59,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:59,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:59,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:59,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:59 BoogieIcfgContainer [2019-10-22 08:55:59,781 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:59,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:59,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:59,782 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:59,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:45" (3/4) ... [2019-10-22 08:55:59,786 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:59,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:59,788 INFO L168 Benchmark]: Toolchain (without parser) took 14991.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 949.9 MB in the beginning and 951.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 194.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:59,788 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:59,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:59,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.18 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-10-22 08:55:59,789 INFO L168 Benchmark]: Boogie Preprocessor took 14.89 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-10-22 08:55:59,790 INFO L168 Benchmark]: RCFGBuilder took 245.32 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:59,790 INFO L168 Benchmark]: BuchiAutomizer took 14461.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 951.8 MB in the end (delta: 170.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:59,790 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.2 GB. Free memory is still 951.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:59,792 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.18 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 14.89 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 245.32 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14461.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 951.8 MB in the end (delta: 170.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.2 GB. Free memory is still 951.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 11 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73c339de and consists of 11 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 15 locations. 5 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.3s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 9.9s. Construction of modules took 0.8s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 249 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 314 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 38/58 HoareTripleCheckerStatistics: 284 SDtfs, 352 SDslu, 489 SDs, 0 SdLazy, 977 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf98 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...