./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:15:01,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:15:01,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:15:01,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:15:01,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:15:01,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:15:01,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:15:01,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:15:01,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:15:01,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:15:01,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:15:01,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:15:01,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:15:01,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:15:01,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:15:01,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:15:01,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:15:01,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:15:01,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:15:01,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:15:01,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:15:01,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:15:01,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:15:01,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:15:01,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:15:01,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:15:01,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:15:01,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:15:01,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:15:01,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:15:01,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:15:01,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:15:01,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:15:01,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:15:01,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:15:01,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:15:01,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:15:01,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:15:01,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:15:01,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:15:01,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:15:01,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:15:01,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:15:01,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:15:01,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:15:01,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:15:01,987 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:15:01,987 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:15:01,988 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:15:01,988 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:15:01,988 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:15:01,989 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:15:01,990 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:15:01,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:15:01,991 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:15:01,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:15:01,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:15:01,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:15:01,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:15:01,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:15:01,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:15:01,993 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:15:01,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:15:01,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:15:01,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:15:01,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:15:01,995 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:15:01,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:15:01,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:15:01,996 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:15:02,000 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:15:02,000 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-15 21:15:02,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:15:02,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:15:02,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:15:02,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:15:02,075 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:15:02,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-15 21:15:02,162 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/data/437ce54fc/7198fe77f1c044c084d0e289ea697426/FLAGb1c86f68b [2019-11-15 21:15:02,693 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:15:02,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-15 21:15:02,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/data/437ce54fc/7198fe77f1c044c084d0e289ea697426/FLAGb1c86f68b [2019-11-15 21:15:03,031 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/data/437ce54fc/7198fe77f1c044c084d0e289ea697426 [2019-11-15 21:15:03,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:15:03,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:15:03,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:03,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:15:03,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:15:03,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25944be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03, skipping insertion in model container [2019-11-15 21:15:03,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,057 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:15:03,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:15:03,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:03,327 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:15:03,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:03,464 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:15:03,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03 WrapperNode [2019-11-15 21:15:03,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:03,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:03,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:15:03,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:15:03,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:03,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:15:03,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:15:03,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:15:03,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... [2019-11-15 21:15:03,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:15:03,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:15:03,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:15:03,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:15:03,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-15 21:15:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-15 21:15:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-15 21:15:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-15 21:15:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:15:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:15:03,846 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:15:03,846 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:15:03,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:03 BoogieIcfgContainer [2019-11-15 21:15:03,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:15:03,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:15:03,849 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:15:03,854 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:15:03,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:03,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:15:03" (1/3) ... [2019-11-15 21:15:03,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66679d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:15:03, skipping insertion in model container [2019-11-15 21:15:03,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:03,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:03" (2/3) ... [2019-11-15 21:15:03,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66679d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:15:03, skipping insertion in model container [2019-11-15 21:15:03,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:03,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:03" (3/3) ... [2019-11-15 21:15:03,862 INFO L371 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-15 21:15:03,922 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:15:03,922 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:15:03,923 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:15:03,923 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:15:03,923 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:15:03,923 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:15:03,923 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:15:03,924 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:15:03,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 21:15:03,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:03,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:03,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:03,987 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:15:03,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:03,988 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:15:03,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 21:15:03,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:03,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:03,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:03,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:15:03,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:04,003 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-11-15 21:15:04,004 INFO L793 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j);< 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 - 1);< 3#rec2ENTRYtrue [2019-11-15 21:15:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-11-15 21:15:04,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501792576] [2019-11-15 21:15:04,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-11-15 21:15:04,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348390008] [2019-11-15 21:15:04,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:04,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348390008] [2019-11-15 21:15:04,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:04,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:04,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737284379] [2019-11-15 21:15:04,277 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:15:04,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:04,303 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-11-15 21:15:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:04,441 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-11-15 21:15:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:15:04,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-11-15 21:15:04,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:04,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 22 transitions. [2019-11-15 21:15:04,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 21:15:04,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 21:15:04,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 21:15:04,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:15:04,468 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:15:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 21:15:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 21:15:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:15:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 21:15:04,507 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:15:04,508 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:15:04,508 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:15:04,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 21:15:04,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:04,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:04,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:04,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:15:04,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:04,513 INFO L791 eck$LassoCheckResult]: Stem: 77#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; 64#L25 call main_#t~ret6 := rec2(main_~x~0);< 63#rec2ENTRY [2019-11-15 21:15:04,513 INFO L793 eck$LassoCheckResult]: Loop: 63#rec2ENTRY ~j := #in~j; 66#L18 assume !(~j <= 0); 71#L20 call #t~ret3 := rec1(~j);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume !(~i <= 0); 68#L14 call #t~ret0 := rec1(~i - 2);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#27#return; 69#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#29#return; 70#L14-2 call #t~ret2 := rec1(#t~ret1);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#31#return; 75#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 76#rec1FINAL assume true; 78#rec1EXIT >#33#return; 65#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 63#rec2ENTRY [2019-11-15 21:15:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 2 times [2019-11-15 21:15:04,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318573676] [2019-11-15 21:15:04,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -616266826, now seen corresponding path program 1 times [2019-11-15 21:15:04,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104047835] [2019-11-15 21:15:04,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,580 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1277860358, now seen corresponding path program 1 times [2019-11-15 21:15:04,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:04,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025166380] [2019-11-15 21:15:04,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:04,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:04,630 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:05,013 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 21:15:05,213 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:05,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:05,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:05,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:05,215 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:15:05,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:05,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:05,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2019-11-15 21:15:05,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:05,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:05,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,337 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:05,338 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:15:05,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:05,351 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:05,363 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:05,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:05,390 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:05,391 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:15:05,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:05,415 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,422 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:05,422 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:15:05,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:05,447 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,456 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:05,456 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:15:05,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:05,466 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:15:05,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:05,501 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:15:05,505 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:05,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:05,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:05,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:05,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:05,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:05,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:05,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:05,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2019-11-15 21:15:05,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:05,507 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:05,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:05,617 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:05,624 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:05,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:05,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:05,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:05,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:05,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:05,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:05,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:05,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:05,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:05,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:05,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:05,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:05,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:05,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:05,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:05,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:05,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:05,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:05,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:05,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:05,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:05,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:05,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:05,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:05,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:05,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:05,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:05,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:05,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:05,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:05,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:05,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:05,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:05,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:05,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:05,696 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:05,703 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:15:05,703 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:15:05,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:05,706 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:15:05,706 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:05,707 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-11-15 21:15:05,709 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:15:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:05,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:15:05,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:05,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 21:15:05,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:15:06,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-15 21:15:06,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-11-15 21:15:06,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 101 states and 147 transitions. Complement of second has 42 states. [2019-11-15 21:15:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:15:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2019-11-15 21:15:06,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2019-11-15 21:15:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:06,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 26 letters. Loop has 24 letters. [2019-11-15 21:15:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:06,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 48 letters. [2019-11-15 21:15:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:06,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 147 transitions. [2019-11-15 21:15:06,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:06,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 89 states and 135 transitions. [2019-11-15 21:15:06,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 21:15:06,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 21:15:06,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 135 transitions. [2019-11-15 21:15:06,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:06,753 INFO L688 BuchiCegarLoop]: Abstraction has 89 states and 135 transitions. [2019-11-15 21:15:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 135 transitions. [2019-11-15 21:15:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-11-15 21:15:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 21:15:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2019-11-15 21:15:06,792 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-11-15 21:15:06,793 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-11-15 21:15:06,799 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:15:06,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 98 transitions. [2019-11-15 21:15:06,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:06,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:06,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:06,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:06,808 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:06,808 INFO L791 eck$LassoCheckResult]: Stem: 375#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; 338#L25 call main_#t~ret6 := rec2(main_~x~0);< 337#rec2ENTRY ~j := #in~j; 340#L18 assume !(~j <= 0); 369#L20 call #t~ret3 := rec1(~j);< 382#rec1ENTRY ~i := #in~i; 368#L12 assume !(~i <= 0); 346#L14 call #t~ret0 := rec1(~i - 2);< 343#rec1ENTRY [2019-11-15 21:15:06,808 INFO L793 eck$LassoCheckResult]: Loop: 343#rec1ENTRY ~i := #in~i; 351#L12 assume !(~i <= 0); 344#L14 call #t~ret0 := rec1(~i - 2);< 343#rec1ENTRY [2019-11-15 21:15:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-11-15 21:15:06,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525654917] [2019-11-15 21:15:06,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-11-15 21:15:06,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199597368] [2019-11-15 21:15:06,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-11-15 21:15:06,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:06,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688235737] [2019-11-15 21:15:06,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:06,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:06,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:06,961 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:06,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:06,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:06,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:06,962 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:15:06,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:06,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:06,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:06,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2019-11-15 21:15:06,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:06,963 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:06,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:06,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:06,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:06,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:06,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,057 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:07,058 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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-11-15 21:15:07,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,080 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-11-15 21:15:07,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,088 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,112 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,112 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,140 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,141 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,159 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,166 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:15:07,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,248 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:15:07,250 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:07,256 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:07,256 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:07,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:07,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:07,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:07,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:07,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2019-11-15 21:15:07,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:07,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:07,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,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-11-15 21:15:07,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-11-15 21:15:07,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:07,341 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:07,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:07,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:07,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:07,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:07,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:07,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:07,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:07,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:07,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:07,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:07,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:07,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:07,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:07,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:07,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:07,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:07,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:07,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:07,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:07,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:07,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:07,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:07,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:07,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:07,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:07,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:07,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:07,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:07,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:07,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:07,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:07,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:07,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:07,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:07,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:07,388 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:07,400 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-15 21:15:07,401 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:07,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:07,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:15:07,402 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:07,402 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-15 21:15:07,403 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:15:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:07,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:15:07,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:07,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:07,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:07,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:15:07,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40 Second operand 4 states. [2019-11-15 21:15:07,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 108 states and 165 transitions. Complement of second has 13 states. [2019-11-15 21:15:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:15:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 21:15:07,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 21:15:07,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:07,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:15:07,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:07,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 21:15:07,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:07,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 165 transitions. [2019-11-15 21:15:07,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:07,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 96 states and 153 transitions. [2019-11-15 21:15:07,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-15 21:15:07,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 21:15:07,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 153 transitions. [2019-11-15 21:15:07,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:07,611 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 153 transitions. [2019-11-15 21:15:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 153 transitions. [2019-11-15 21:15:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-15 21:15:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:15:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2019-11-15 21:15:07,627 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-11-15 21:15:07,627 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-11-15 21:15:07,627 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:15:07,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 143 transitions. [2019-11-15 21:15:07,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:07,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:07,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:07,632 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:07,632 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:07,632 INFO L791 eck$LassoCheckResult]: Stem: 617#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; 618#L25 call main_#t~ret6 := rec2(main_~x~0);< 621#rec2ENTRY ~j := #in~j; 638#L18 assume !(~j <= 0); 592#L20 call #t~ret3 := rec1(~j);< 630#rec1ENTRY ~i := #in~i; 639#L12 assume !(~i <= 0); 580#L14 call #t~ret0 := rec1(~i - 2);< 579#rec1ENTRY ~i := #in~i; 582#L12 assume ~i <= 0;#res := 0; 641#rec1FINAL assume true; 626#rec1EXIT >#27#return; 591#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 594#rec1ENTRY [2019-11-15 21:15:07,633 INFO L793 eck$LassoCheckResult]: Loop: 594#rec1ENTRY ~i := #in~i; 634#L12 assume !(~i <= 0); 610#L14 call #t~ret0 := rec1(~i - 2);< 594#rec1ENTRY [2019-11-15 21:15:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-11-15 21:15:07,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:07,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348297958] [2019-11-15 21:15:07,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:07,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-11-15 21:15:07,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:07,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539638784] [2019-11-15 21:15:07,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:07,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-11-15 21:15:07,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:07,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738095966] [2019-11-15 21:15:07,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:07,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:15:07,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738095966] [2019-11-15 21:15:07,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:07,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:07,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793037215] [2019-11-15 21:15:07,783 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:07,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:07,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:07,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:07,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:15:07,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:07,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:07,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2019-11-15 21:15:07,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:07,784 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:07,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-11-15 21:15:07,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-11-15 21:15:07,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:07,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:07,886 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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-11-15 21:15:07,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,892 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-11-15 21:15:07,898 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,898 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,919 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:07,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:07,934 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:07,940 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:07,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:15:07,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:08,005 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:15:08,007 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:08,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:08,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:08,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:08,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:08,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:08,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:08,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:08,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2019-11-15 21:15:08,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:08,008 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:08,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:08,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:08,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-11-15 21:15:08,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:08,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:08,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:08,069 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:08,069 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:08,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:08,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:08,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:08,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:08,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:08,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:08,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:08,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:08,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:08,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:08,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:08,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:08,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:08,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:08,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:08,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:08,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:08,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:08,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:08,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:08,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:08,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:08,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:08,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:08,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:08,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:08,085 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:08,087 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-15 21:15:08,087 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:08,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:08,088 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:15:08,088 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:08,088 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-15 21:15:08,089 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:15:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:15:08,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:08,218 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:08,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57 Second operand 5 states. [2019-11-15 21:15:08,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57. Second operand 5 states. Result 132 states and 207 transitions. Complement of second has 14 states. [2019-11-15 21:15:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-15 21:15:08,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 21:15:08,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:08,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-15 21:15:08,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:08,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-15 21:15:08,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:08,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 207 transitions. [2019-11-15 21:15:08,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:08,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 120 states and 195 transitions. [2019-11-15 21:15:08,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-15 21:15:08,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-11-15 21:15:08,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 195 transitions. [2019-11-15 21:15:08,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:08,342 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 195 transitions. [2019-11-15 21:15:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 195 transitions. [2019-11-15 21:15:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-11-15 21:15:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 21:15:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2019-11-15 21:15:08,359 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 185 transitions. [2019-11-15 21:15:08,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:08,360 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand 6 states. [2019-11-15 21:15:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:08,412 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2019-11-15 21:15:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:08,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 195 transitions. [2019-11-15 21:15:08,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 21:15:08,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 193 transitions. [2019-11-15 21:15:08,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-11-15 21:15:08,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-15 21:15:08,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 193 transitions. [2019-11-15 21:15:08,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:08,425 INFO L688 BuchiCegarLoop]: Abstraction has 127 states and 193 transitions. [2019-11-15 21:15:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 193 transitions. [2019-11-15 21:15:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2019-11-15 21:15:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:15:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2019-11-15 21:15:08,442 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-11-15 21:15:08,442 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-11-15 21:15:08,443 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:15:08,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 157 transitions. [2019-11-15 21:15:08,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 21:15:08,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:08,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:08,447 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:08,447 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:08,447 INFO L791 eck$LassoCheckResult]: Stem: 1186#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; 1187#L25 call main_#t~ret6 := rec2(main_~x~0);< 1194#rec2ENTRY ~j := #in~j; 1208#L18 assume !(~j <= 0); 1200#L20 call #t~ret3 := rec1(~j);< 1207#rec1ENTRY ~i := #in~i; 1206#L12 assume !(~i <= 0); 1154#L14 call #t~ret0 := rec1(~i - 2);< 1205#rec1ENTRY ~i := #in~i; 1203#L12 assume !(~i <= 0); 1165#L14 call #t~ret0 := rec1(~i - 2);< 1202#rec1ENTRY ~i := #in~i; 1204#L12 assume ~i <= 0;#res := 0; 1229#rec1FINAL assume true; 1184#rec1EXIT >#27#return; 1147#L14-1 [2019-11-15 21:15:08,448 INFO L793 eck$LassoCheckResult]: Loop: 1147#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1145#rec1ENTRY ~i := #in~i; 1148#L12 assume ~i <= 0;#res := 0; 1221#rec1FINAL assume true; 1215#rec1EXIT >#29#return; 1160#L14-2 call #t~ret2 := rec1(#t~ret1);< 1182#rec1ENTRY ~i := #in~i; 1218#L12 assume !(~i <= 0); 1162#L14 call #t~ret0 := rec1(~i - 2);< 1182#rec1ENTRY ~i := #in~i; 1218#L12 assume ~i <= 0;#res := 0; 1217#rec1FINAL assume true; 1216#rec1EXIT >#27#return; 1147#L14-1 [2019-11-15 21:15:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,448 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-11-15 21:15:08,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137343322] [2019-11-15 21:15:08,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,462 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-11-15 21:15:08,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714769116] [2019-11-15 21:15:08,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:15:08,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714769116] [2019-11-15 21:15:08,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213749243] [2019-11-15 21:15:08,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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-11-15 21:15:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:15:08,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:08,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:15:08,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-11-15 21:15:08,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704653551] [2019-11-15 21:15:08,572 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:15:08,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:08,573 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. cyclomatic complexity: 59 Second operand 6 states. [2019-11-15 21:15:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:08,634 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2019-11-15 21:15:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:15:08,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 173 transitions. [2019-11-15 21:15:08,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:08,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 114 states and 164 transitions. [2019-11-15 21:15:08,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-11-15 21:15:08,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-11-15 21:15:08,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 164 transitions. [2019-11-15 21:15:08,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:08,656 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 164 transitions. [2019-11-15 21:15:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 164 transitions. [2019-11-15 21:15:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-11-15 21:15:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:15:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2019-11-15 21:15:08,681 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-11-15 21:15:08,682 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-11-15 21:15:08,682 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:15:08,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. [2019-11-15 21:15:08,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 21:15:08,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:08,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:08,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:08,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:08,692 INFO L791 eck$LassoCheckResult]: Stem: 1471#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; 1472#L25 call main_#t~ret6 := rec2(main_~x~0);< 1479#rec2ENTRY ~j := #in~j; 1501#L18 assume !(~j <= 0); 1481#L20 call #t~ret3 := rec1(~j);< 1494#rec1ENTRY ~i := #in~i; 1491#L12 assume !(~i <= 0); 1440#L14 call #t~ret0 := rec1(~i - 2);< 1488#rec1ENTRY ~i := #in~i; 1486#L12 assume !(~i <= 0); 1437#L14 call #t~ret0 := rec1(~i - 2);< 1485#rec1ENTRY ~i := #in~i; 1487#L12 assume ~i <= 0;#res := 0; 1505#rec1FINAL assume true; 1496#rec1EXIT >#27#return; 1448#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1449#rec1ENTRY ~i := #in~i; 1508#L12 assume ~i <= 0;#res := 0; 1507#rec1FINAL assume true; 1506#rec1EXIT >#29#return; 1428#L14-2 call #t~ret2 := rec1(#t~ret1);< 1427#rec1ENTRY ~i := #in~i; 1429#L12 assume ~i <= 0;#res := 0; 1465#rec1FINAL assume true; 1467#rec1EXIT >#31#return; 1460#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 1434#rec1FINAL assume true; 1444#rec1EXIT >#27#return; 1441#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1474#rec1ENTRY [2019-11-15 21:15:08,692 INFO L793 eck$LassoCheckResult]: Loop: 1474#rec1ENTRY ~i := #in~i; 1504#L12 assume !(~i <= 0); 1438#L14 call #t~ret0 := rec1(~i - 2);< 1474#rec1ENTRY [2019-11-15 21:15:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-11-15 21:15:08,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744273656] [2019-11-15 21:15:08,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-11-15 21:15:08,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116022342] [2019-11-15 21:15:08,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:08,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2050992272, now seen corresponding path program 2 times [2019-11-15 21:15:08,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:08,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424917807] [2019-11-15 21:15:08,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:08,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 21:15:08,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424917807] [2019-11-15 21:15:08,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68748341] [2019-11-15 21:15:08,942 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:15:09,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:15:09,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:15:09,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 21:15:09,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:15:09,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:15:09,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756572988] [2019-11-15 21:15:09,098 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:09,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:09,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:09,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:09,099 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:15:09,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:09,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:09,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2019-11-15 21:15:09,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:09,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:09,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,149 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:09,149 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:09,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:09,164 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:09,164 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:09,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:09,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:09,178 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:09,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:09,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:09,190 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:09,206 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:15:09,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:09,224 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:15:09,226 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:09,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:09,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:09,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:09,226 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:09,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:09,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:09,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:09,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2019-11-15 21:15:09,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:09,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:09,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:09,275 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:09,275 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:09,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:09,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:09,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:09,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:09,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:09,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:09,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:09,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:09,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:09,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:09,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:09,280 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:09,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:09,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:09,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:09,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:09,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:09,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:09,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:09,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:09,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:09,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:09,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:09,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:09,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:09,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:09,286 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:09,288 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-15 21:15:09,288 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:09,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:09,289 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:15:09,289 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:09,291 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-15 21:15:09,291 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:15:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:09,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:09,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-11-15 21:15:09,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-11-15 21:15:09,599 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-11-15 21:15:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 21:15:09,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:09,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:09,602 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:15:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:09,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:09,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-11-15 21:15:09,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-11-15 21:15:09,881 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-11-15 21:15:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 21:15:09,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:09,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:09,883 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:15:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:09,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:09,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:09,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:10,027 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:10,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-11-15 21:15:10,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 156 states and 218 transitions. Complement of second has 13 states. [2019-11-15 21:15:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-15 21:15:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-11-15 21:15:10,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:10,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-11-15 21:15:10,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:10,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 218 transitions. [2019-11-15 21:15:10,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-11-15 21:15:10,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 138 states and 200 transitions. [2019-11-15 21:15:10,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-15 21:15:10,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-11-15 21:15:10,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 200 transitions. [2019-11-15 21:15:10,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:10,175 INFO L688 BuchiCegarLoop]: Abstraction has 138 states and 200 transitions. [2019-11-15 21:15:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 200 transitions. [2019-11-15 21:15:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2019-11-15 21:15:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 21:15:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2019-11-15 21:15:10,192 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2019-11-15 21:15:10,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:15:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:15:10,193 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand 8 states. [2019-11-15 21:15:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:10,282 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-11-15 21:15:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:15:10,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 115 transitions. [2019-11-15 21:15:10,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:10,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 62 states and 74 transitions. [2019-11-15 21:15:10,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:15:10,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:15:10,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 74 transitions. [2019-11-15 21:15:10,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:10,288 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-11-15 21:15:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 74 transitions. [2019-11-15 21:15:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-11-15 21:15:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 21:15:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-15 21:15:10,294 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-15 21:15:10,295 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-15 21:15:10,295 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:15:10,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2019-11-15 21:15:10,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:10,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:10,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:10,297 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:10,297 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:10,298 INFO L791 eck$LassoCheckResult]: Stem: 2675#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; 2650#L25 call main_#t~ret6 := rec2(main_~x~0);< 2649#rec2ENTRY ~j := #in~j; 2651#L18 assume !(~j <= 0); 2679#L20 call #t~ret3 := rec1(~j);< 2690#rec1ENTRY ~i := #in~i; 2691#L12 assume !(~i <= 0); 2669#L14 call #t~ret0 := rec1(~i - 2);< 2688#rec1ENTRY ~i := #in~i; 2698#L12 assume ~i <= 0;#res := 0; 2701#rec1FINAL assume true; 2687#rec1EXIT >#27#return; 2661#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 2660#rec1ENTRY ~i := #in~i; 2663#L12 assume ~i <= 0;#res := 0; 2664#rec1FINAL assume true; 2665#rec1EXIT >#29#return; 2684#L14-2 call #t~ret2 := rec1(#t~ret1);< 2673#rec1ENTRY ~i := #in~i; 2686#L12 assume ~i <= 0;#res := 0; 2685#rec1FINAL assume true; 2683#rec1EXIT >#31#return; 2682#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 2681#rec1FINAL assume true; 2680#rec1EXIT >#33#return; 2653#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 2652#rec2ENTRY ~j := #in~j; 2655#L18 assume !(~j <= 0); 2659#L20 call #t~ret3 := rec1(~j);< 2656#rec1ENTRY [2019-11-15 21:15:10,298 INFO L793 eck$LassoCheckResult]: Loop: 2656#rec1ENTRY ~i := #in~i; 2658#L12 assume !(~i <= 0); 2657#L14 call #t~ret0 := rec1(~i - 2);< 2656#rec1ENTRY [2019-11-15 21:15:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1852176490, now seen corresponding path program 2 times [2019-11-15 21:15:10,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:10,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279216569] [2019-11-15 21:15:10,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:10,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:10,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:15:10,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279216569] [2019-11-15 21:15:10,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861722252] [2019-11-15 21:15:10,437 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:15:10,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:15:10,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:15:10,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:10,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:15:10,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:15:10,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:15:10,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966054593] [2019-11-15 21:15:10,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:15:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 4 times [2019-11-15 21:15:10,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:10,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93428447] [2019-11-15 21:15:10,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:10,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:10,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:10,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:10,565 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:10,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:10,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:10,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:10,565 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:15:10,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:10,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:10,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2019-11-15 21:15:10,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:10,566 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:10,638 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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) [2019-11-15 21:15:10,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:10,653 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,658 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:10,658 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:15:10,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:10,667 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:10,672 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/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) [2019-11-15 21:15:10,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:10,683 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,688 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:10,688 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:10,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:10,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:15:10,697 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/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:15:10,703 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9b6321f-b550-40b6-9682-4826eab1d4f4/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:15:10,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:15:10,718 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:15:10,720 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:10,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:10,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:10,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:10,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:10,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:10,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:10,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:10,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2019-11-15 21:15:10,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:10,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:10,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:10,776 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:10,776 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:10,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:10,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:10,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:10,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:10,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:10,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:10,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:10,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:10,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:10,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:10,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:10,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:10,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:10,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:10,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:10,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:10,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:10,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:10,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:10,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:10,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:10,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:10,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:10,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:10,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:10,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:10,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:10,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:10,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:10,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:10,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:10,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:10,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:10,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:10,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:10,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:10,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:15:10,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:10,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:10,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:10,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:10,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:10,798 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:10,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:10,801 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:10,803 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-15 21:15:10,803 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:10,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:10,804 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:15:10,804 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:10,804 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-15 21:15:10,805 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:15:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:10,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:10,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:10,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:10,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:10,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:10,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:10,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 21:15:11,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-11-15 21:15:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 21:15:11,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:11,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:11,080 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:15:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:11,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:11,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:11,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:11,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:11,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:11,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:11,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 21:15:11,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-11-15 21:15:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 21:15:11,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:11,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:11,365 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:15:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:11,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:15:11,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:11,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:11,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:15:11,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:11,497 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:15:11,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 21:15:11,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 77 states and 89 transitions. Complement of second has 13 states. [2019-11-15 21:15:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-15 21:15:11,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-11-15 21:15:11,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:11,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-11-15 21:15:11,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:11,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-11-15 21:15:11,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:11,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 89 transitions. [2019-11-15 21:15:11,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:15:11,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-11-15 21:15:11,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:15:11,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:15:11,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:15:11,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:15:11,603 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:15:11,603 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:15:11,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:15:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:15:11,604 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 8 states. [2019-11-15 21:15:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:11,604 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 21:15:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:15:11,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 21:15:11,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:15:11,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:15:11,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:15:11,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:15:11,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:15:11,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:15:11,605 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:15:11,605 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:15:11,606 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:15:11,606 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:15:11,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:15:11,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:15:11,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:15:11,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:15:11 BoogieIcfgContainer [2019-11-15 21:15:11,615 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:15:11,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:15:11,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:15:11,616 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:15:11,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:03" (3/4) ... [2019-11-15 21:15:11,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:15:11,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:15:11,622 INFO L168 Benchmark]: Toolchain (without parser) took 8585.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -249.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:11,623 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:15:11,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:11,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:15:11,625 INFO L168 Benchmark]: Boogie Preprocessor took 30.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:15:11,625 INFO L168 Benchmark]: RCFGBuilder took 305.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:11,627 INFO L168 Benchmark]: BuchiAutomizer took 7766.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:11,627 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-15 21:15:11,630 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 305.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7766.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 10 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 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 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 3.7s. Construction of modules took 0.6s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 188 SDtfs, 186 SDslu, 297 SDs, 0 SdLazy, 307 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...