./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b7166d94206693c3f254a3c1de8d5825f8510fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:46:36,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:46:36,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:46:36,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:46:36,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:46:36,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:46:36,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:46:36,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:46:36,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:46:36,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:46:36,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:46:36,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:46:36,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:46:36,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:46:36,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:46:36,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:46:36,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:46:36,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:46:36,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:46:36,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:46:36,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:46:36,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:46:36,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:46:36,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:46:36,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:46:36,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:46:36,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:46:36,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:46:36,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:46:36,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:46:36,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:46:36,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:46:36,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:46:36,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:46:36,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:46:36,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:46:36,918 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 09:46:36,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:46:36,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:46:36,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:46:36,928 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 09:46:36,928 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 09:46:36,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 09:46:36,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 09:46:36,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:46:36,930 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 09:46:36,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:46:36,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:46:36,931 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 09:46:36,931 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 09:46:36,932 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2018-11-23 09:46:36,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:46:36,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:46:36,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:46:36,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:46:36,970 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:46:36,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-23 09:46:37,015 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/data/f2cea3af3/2617a0102d8242dfaaf26d70903f3b8b/FLAGdb1c92b10 [2018-11-23 09:46:37,342 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:46:37,342 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-23 09:46:37,347 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/data/f2cea3af3/2617a0102d8242dfaaf26d70903f3b8b/FLAGdb1c92b10 [2018-11-23 09:46:37,773 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/data/f2cea3af3/2617a0102d8242dfaaf26d70903f3b8b [2018-11-23 09:46:37,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:46:37,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:46:37,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:46:37,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:46:37,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:46:37,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37, skipping insertion in model container [2018-11-23 09:46:37,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:46:37,803 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:46:37,902 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:46:37,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:46:37,914 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:46:37,922 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:46:37,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37 WrapperNode [2018-11-23 09:46:37,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:46:37,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:46:37,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:46:37,923 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:46:37,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:46:37,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:46:37,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:46:37,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:46:37,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... [2018-11-23 09:46:37,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:46:37,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:46:37,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:46:37,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:46:37,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,024 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 09:46:38,024 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 09:46:38,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:46:38,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:46:38,100 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:46:38,100 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:46:38,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:46:38 BoogieIcfgContainer [2018-11-23 09:46:38,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:46:38,101 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 09:46:38,101 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 09:46:38,103 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 09:46:38,103 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:46:38,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 09:46:37" (1/3) ... [2018-11-23 09:46:38,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45e34200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:46:38, skipping insertion in model container [2018-11-23 09:46:38,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:46:38,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:46:37" (2/3) ... [2018-11-23 09:46:38,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45e34200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:46:38, skipping insertion in model container [2018-11-23 09:46:38,105 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:46:38,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:46:38" (3/3) ... [2018-11-23 09:46:38,106 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-23 09:46:38,139 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:46:38,140 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 09:46:38,140 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 09:46:38,140 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 09:46:38,140 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:46:38,140 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:46:38,140 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 09:46:38,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:46:38,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 09:46:38,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 09:46:38,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:46:38,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:46:38,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:46:38,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 09:46:38,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 09:46:38,171 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 09:46:38,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 09:46:38,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:46:38,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:46:38,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:46:38,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 09:46:38,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 09:46:38,179 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 7#L20true assume !(main_~x~0 < 0); 9#L21true call main_#t~ret3 := g(main_~x~0);< 11#gENTRYtrue [2018-11-23 09:46:38,179 INFO L796 eck$LassoCheckResult]: Loop: 11#gENTRYtrue ~x := #in~x; 3#L12true assume !(0 == ~x); 13#L15true call #t~ret0 := g(~x - 1);< 11#gENTRYtrue [2018-11-23 09:46:38,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 39891, now seen corresponding path program 1 times [2018-11-23 09:46:38,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 29936, now seen corresponding path program 1 times [2018-11-23 09:46:38,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:38,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:38,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1188392926, now seen corresponding path program 1 times [2018-11-23 09:46:38,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:38,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:38,327 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:38,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:38,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:38,328 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:38,328 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 09:46:38,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:38,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:38,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-23 09:46:38,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:38,329 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:38,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:38,412 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,425 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,426 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,444 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,468 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,515 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 09:46:38,531 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,541 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,542 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-1} Honda state: {g_#in~x=-1} Generalized eigenvectors: [{g_#in~x=0}, {g_#in~x=-1}, {g_#in~x=0}] Lambdas: [8, 1, 8] Nus: [0, 0] [2018-11-23 09:46:38,578 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:38,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:38,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:38,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:38,579 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 09:46:38,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:38,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:38,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-11-23 09:46:38,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:38,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:38,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,667 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:38,667 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,678 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,706 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,706 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,734 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/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 [2018-11-23 09:46:38,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,757 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,782 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret4=0} Honda state: {ULTIMATE.start_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,816 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:38,817 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:38,832 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 09:46:38,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:38,871 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 09:46:38,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:38,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:38,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:38,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:38,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:46:38,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:38,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:38,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:38,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-11-23 09:46:38,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:38,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:38,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:38,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:38,928 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:46:38,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:38,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:38,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:38,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:38,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:38,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:38,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:38,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:38,958 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:46:38,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:38,964 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:46:38,964 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:46:39,026 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:46:39,053 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 09:46:39,053 INFO L444 ModelExtractionUtils]: 4 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 09:46:39,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:46:39,059 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 09:46:39,059 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:46:39,060 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [1*g_#in~x >= 0] [2018-11-23 09:46:39,078 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 09:46:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:39,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:39,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:46:39,201 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 09:46:39,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 5 states. [2018-11-23 09:46:39,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 5 states. Result 35 states and 42 transitions. Complement of second has 13 states. [2018-11-23 09:46:39,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:46:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:46:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 09:46:39,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 09:46:39,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:39,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 09:46:39,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:39,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 09:46:39,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:39,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-23 09:46:39,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:46:39,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2018-11-23 09:46:39,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 09:46:39,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 09:46:39,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-23 09:46:39,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:46:39,338 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-23 09:46:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-23 09:46:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 09:46:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 09:46:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 09:46:39,357 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 09:46:39,357 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 09:46:39,357 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 09:46:39,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 09:46:39,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 09:46:39,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:46:39,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:46:39,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:46:39,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 09:46:39,360 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 121#L20 assume !(main_~x~0 < 0); 118#L21 call main_#t~ret3 := g(main_~x~0);< 119#gENTRY ~x := #in~x; 117#L12 assume !(0 == ~x); 115#L15 call #t~ret0 := g(~x - 1);< 122#gENTRY ~x := #in~x; 114#L12 assume 0 == ~x;#res := 1; 116#gFINAL assume true; 123#gEXIT >#22#return; 125#L15-1 [2018-11-23 09:46:39,360 INFO L796 eck$LassoCheckResult]: Loop: 125#L15-1 call #t~ret1 := g(1 + #t~ret0);< 126#gENTRY ~x := #in~x; 129#L12 assume !(0 == ~x); 124#L15 call #t~ret0 := g(~x - 1);< 126#gENTRY ~x := #in~x; 129#L12 assume 0 == ~x;#res := 1; 128#gFINAL assume true; 130#gEXIT >#22#return; 125#L15-1 [2018-11-23 09:46:39,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -54633169, now seen corresponding path program 1 times [2018-11-23 09:46:39,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:39,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:39,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash -243608724, now seen corresponding path program 1 times [2018-11-23 09:46:39,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:39,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash -791141734, now seen corresponding path program 1 times [2018-11-23 09:46:39,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:46:39,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:46:39,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:46:39,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:39,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:46:39,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:46:39,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 09:46:39,542 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:39,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:39,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:39,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:39,543 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 09:46:39,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:39,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:39,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:39,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-23 09:46:39,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:39,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:39,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:39,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:39,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:39,582 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/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 [2018-11-23 09:46:39,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:39,591 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:39,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 09:46:39,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:40,534 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 09:46:40,536 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:40,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:40,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:40,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:40,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:46:40,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:40,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:40,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:40,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-23 09:46:40,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:40,537 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:40,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:40,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:40,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:40,579 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:40,579 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:46:40,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:40,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:40,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:40,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:40,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:40,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:40,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:40,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:40,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:46:40,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:46:40,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:46:40,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:46:40,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:46:40,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:46:40,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:46:40,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:46:40,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:46:40,589 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:46:40,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:46:40,591 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 09:46:40,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:46:40,592 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 09:46:40,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:46:40,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#t~ret0) = -2*g_#t~ret0 + 1 Supporting invariants [] [2018-11-23 09:46:40,592 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 09:46:40,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:40,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:40,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:46:40,708 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-23 09:46:40,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-23 09:46:40,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 82 states and 120 transitions. Complement of second has 31 states. [2018-11-23 09:46:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-23 09:46:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:46:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 09:46:40,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 09:46:40,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:40,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-23 09:46:40,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:40,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 10 letters. Loop has 16 letters. [2018-11-23 09:46:40,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:46:40,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 120 transitions. [2018-11-23 09:46:40,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 09:46:40,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 58 states and 81 transitions. [2018-11-23 09:46:40,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 09:46:40,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 09:46:40,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2018-11-23 09:46:40,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:46:40,915 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2018-11-23 09:46:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2018-11-23 09:46:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-11-23 09:46:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 09:46:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-11-23 09:46:40,920 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-23 09:46:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:46:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:46:40,922 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2018-11-23 09:46:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:46:40,966 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 09:46:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 09:46:40,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2018-11-23 09:46:40,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:46:40,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 34 transitions. [2018-11-23 09:46:40,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 09:46:40,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 09:46:40,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-11-23 09:46:40,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:46:40,969 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 09:46:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-11-23 09:46:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-23 09:46:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 09:46:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 09:46:40,971 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 09:46:40,971 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 09:46:40,972 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 09:46:40,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2018-11-23 09:46:40,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:46:40,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:46:40,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:46:40,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:46:40,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 09:46:40,973 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 493#L20 assume !(main_~x~0 < 0); 490#L21 call main_#t~ret3 := g(main_~x~0);< 491#gENTRY ~x := #in~x; 488#L12 assume !(0 == ~x); 489#L15 call #t~ret0 := g(~x - 1);< 497#gENTRY ~x := #in~x; 498#L12 assume 0 == ~x;#res := 1; 506#gFINAL assume true; 504#gEXIT >#22#return; 486#L15-1 call #t~ret1 := g(1 + #t~ret0);< 509#gENTRY ~x := #in~x; 485#L12 assume !(0 == ~x); 487#L15 call #t~ret0 := g(~x - 1);< 503#gENTRY ~x := #in~x; 507#L12 assume !(0 == ~x); 500#L15 [2018-11-23 09:46:40,973 INFO L796 eck$LassoCheckResult]: Loop: 500#L15 call #t~ret0 := g(~x - 1);< 505#gENTRY ~x := #in~x; 508#L12 assume !(0 == ~x); 500#L15 [2018-11-23 09:46:40,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2001409165, now seen corresponding path program 2 times [2018-11-23 09:46:40,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:40,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:46:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:40,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash 49976, now seen corresponding path program 2 times [2018-11-23 09:46:40,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:40,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:40,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:46:40,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:40,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1244451628, now seen corresponding path program 3 times [2018-11-23 09:46:40,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:40,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:46:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:46:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:46:41,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:46:41,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:46:41,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 09:46:41,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 09:46:41,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:46:41,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:46:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:46:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:46:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 09:46:41,125 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:46:41,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:46:41,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:46:41,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:46:41,125 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 09:46:41,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:41,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:46:41,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:46:41,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-23 09:46:41,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:46:41,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:46:41,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:41,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:41,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:46:41,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:46:41,155 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:41,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:41,162 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/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 [2018-11-23 09:46:41,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 09:46:41,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:41,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:41,308 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-8, g_~x=-8} Honda state: {g_#in~x=-8, g_~x=-8} Generalized eigenvectors: [{g_#in~x=0, g_~x=0}, {g_#in~x=-1, g_~x=-1}, {g_#in~x=0, g_~x=0}] Lambdas: [8, 1, 3] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:41,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:41,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:41,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:41,325 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:41,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:41,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:41,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:41,342 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:46:41,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 09:46:41,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 09:46:41,359 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 09:46:41,359 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-23 09:46:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 09:46:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 09:46:41,372 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-23 09:46:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:46:41,460 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 09:46:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:46:41,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2018-11-23 09:46:41,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:46:41,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 09:46:41,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 09:46:41,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 09:46:41,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2018-11-23 09:46:41,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:46:41,461 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 09:46:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2018-11-23 09:46:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-11-23 09:46:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 09:46:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 09:46:41,463 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 09:46:41,463 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 09:46:41,463 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 09:46:41,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-23 09:46:41,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:46:41,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:46:41,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:46:41,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:46:41,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-23 09:46:41,465 INFO L794 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 626#L20 assume !(main_~x~0 < 0); 618#L21 call main_#t~ret3 := g(main_~x~0);< 619#gENTRY ~x := #in~x; 623#L12 assume !(0 == ~x); 624#L15 call #t~ret0 := g(~x - 1);< 628#gENTRY ~x := #in~x; 629#L12 assume 0 == ~x;#res := 1; 636#gFINAL assume true; 634#gEXIT >#22#return; 621#L15-1 [2018-11-23 09:46:41,465 INFO L796 eck$LassoCheckResult]: Loop: 621#L15-1 call #t~ret1 := g(1 + #t~ret0);< 627#gENTRY ~x := #in~x; 620#L12 assume !(0 == ~x); 622#L15 call #t~ret0 := g(~x - 1);< 633#gENTRY ~x := #in~x; 637#L12 assume !(0 == ~x); 631#L15 call #t~ret0 := g(~x - 1);< 635#gENTRY ~x := #in~x; 638#L12 assume 0 == ~x;#res := 1; 630#gFINAL assume true; 632#gEXIT >#22#return; 621#L15-1 [2018-11-23 09:46:41,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash -54633169, now seen corresponding path program 2 times [2018-11-23 09:46:41,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:46:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:41,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1187216231, now seen corresponding path program 2 times [2018-11-23 09:46:41,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:46:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:41,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:46:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1917105529, now seen corresponding path program 4 times [2018-11-23 09:46:41,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:46:41,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:46:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:46:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:46:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:46:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !(main_~x~0 < 0); [?] CALL call main_#t~ret3 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + #t~ret0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- [2018-11-23 09:46:41,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 09:46:41 BoogieIcfgContainer [2018-11-23 09:46:41,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 09:46:41,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:46:41,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:46:41,607 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:46:41,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:46:38" (3/4) ... [2018-11-23 09:46:41,610 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !(main_~x~0 < 0); [?] CALL call main_#t~ret3 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + #t~ret0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- [2018-11-23 09:46:41,647 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b1b98f3f-30bf-478e-9e3b-c465f4830bad/bin-2019/uautomizer/witness.graphml [2018-11-23 09:46:41,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:46:41,648 INFO L168 Benchmark]: Toolchain (without parser) took 3871.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 959.2 MB in the beginning and 955.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 134.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:46:41,649 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:46:41,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.39 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:46:41,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:46:41,650 INFO L168 Benchmark]: Boogie Preprocessor took 9.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:46:41,651 INFO L168 Benchmark]: RCFGBuilder took 149.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:46:41,651 INFO L168 Benchmark]: BuchiAutomizer took 3506.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 164.6 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. [2018-11-23 09:46:41,651 INFO L168 Benchmark]: Witness Printer took 40.42 ms. Allocated memory is still 1.2 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:46:41,653 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.39 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3506.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 164.6 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. * Witness Printer took 40.42 ms. Allocated memory is still 1.2 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 5 locations. One deterministic module has affine ranking function -2 * aux-g(x - 1)-aux + 1 and consists of 10 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:4. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 46 SDtfs, 67 SDslu, 97 SDs, 0 SdLazy, 225 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq194 hnf92 smp100 dnf139 smp100 tf104 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 102ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12be405e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54e11df7=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9910d70=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c669748=0, x=0, x=1, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !(main_~x~0 < 0); [?] CALL call main_#t~ret3 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + #t~ret0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !(main_~x~0 < 0); [?] CALL call main_#t~ret3 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] assume !(main_~x~0 < 0); [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0; [L19] main_~x~0 := main_#t~nondet2; [L19] havoc main_#t~nondet2; [L20] COND FALSE !(main_~x~0 < 0) [L21] CALL call main_#t~ret3 := g(main_~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L19] ~x~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] COND FALSE !(~x~0 < 0) [L21] CALL call #t~ret3 := g(~x~0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + #t~ret0); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume !(0 == ~x); [?] CALL call #t~ret0 := g(~x - 1); [?] ~x := #in~x; [?] assume 0 == ~x;#res := 1; [?] assume true; [?] RET #22#return; [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume !(0 == ~x); [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12-L15] assume 0 == ~x; [L13] #res := 1; [L10-L16] ensures true; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] CALL call #t~ret1 := g(1 + #t~ret0); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND FALSE !(0 == ~x) [L15] CALL call #t~ret0 := g(~x - 1); [L10-L16] ~x := #in~x; [L12] COND TRUE 0 == ~x [L13] #res := 1; [L15] RET call #t~ret0 := g(~x - 1); [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) Loop: [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...