./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_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_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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 c27ad91a5bec233234e07a14bfd5505e082df4cd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-22 21:53:27,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:53:27,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:53:27,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:53:27,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:53:27,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:53:27,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:53:27,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:53:27,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:53:27,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:53:27,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:53:27,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:53:27,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:53:27,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:53:27,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:53:27,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:53:27,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:53:27,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:53:27,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:53:27,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:53:27,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:53:27,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:53:27,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:53:27,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:53:27,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:53:27,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:53:27,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:53:27,136 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:53:27,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:53:27,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:53:27,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:53:27,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:53:27,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:53:27,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:53:27,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:53:27,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:53:27,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:53:27,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:53:27,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:53:27,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:53:27,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:53:27,157 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:53:27,158 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:53:27,158 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:53:27,158 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:53:27,158 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:53:27,158 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:53:27,158 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:53:27,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:53:27,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:53:27,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:53:27,160 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:53:27,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:53:27,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:53:27,161 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:53:27,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:53:27,162 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_a825427b-c27e-46e5-9f56-f49a3282b5fe/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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2018-11-22 21:53:27,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:53:27,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:53:27,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:53:27,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:53:27,205 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:53:27,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-22 21:53:27,260 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/data/e76999461/82dcc0516d1f4e63a4e6fbedef9fecde/FLAGcd50f5f19 [2018-11-22 21:53:27,623 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:53:27,624 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-22 21:53:27,630 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/data/e76999461/82dcc0516d1f4e63a4e6fbedef9fecde/FLAGcd50f5f19 [2018-11-22 21:53:27,645 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/data/e76999461/82dcc0516d1f4e63a4e6fbedef9fecde [2018-11-22 21:53:27,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:53:27,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:53:27,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:53:27,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:53:27,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:53:27,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12858536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27, skipping insertion in model container [2018-11-22 21:53:27,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:53:27,684 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:53:27,840 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:53:27,843 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:53:27,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:53:27,871 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:53:27,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27 WrapperNode [2018-11-22 21:53:27,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:53:27,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:53:27,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:53:27,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:53:27,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:53:27,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:53:27,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:53:27,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:53:27,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... [2018-11-22 21:53:27,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:53:27,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:53:27,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:53:27,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:53:27,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-22 21:53:28,003 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-22 21:53:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-22 21:53:28,003 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-22 21:53:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:53:28,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:53:28,104 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:53:28,104 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-22 21:53:28,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:28 BoogieIcfgContainer [2018-11-22 21:53:28,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:53:28,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:53:28,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:53:28,107 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:53:28,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:53:28,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:53:27" (1/3) ... [2018-11-22 21:53:28,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5093b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:53:28, skipping insertion in model container [2018-11-22 21:53:28,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:53:28,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:27" (2/3) ... [2018-11-22 21:53:28,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5093b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:53:28, skipping insertion in model container [2018-11-22 21:53:28,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:53:28,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:28" (3/3) ... [2018-11-22 21:53:28,110 INFO L375 chiAutomizerObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-22 21:53:28,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:53:28,154 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:53:28,154 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:53:28,154 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:53:28,154 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:53:28,154 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:53:28,154 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:53:28,154 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:53:28,155 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:53:28,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-22 21:53:28,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:28,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:53:28,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:53:28,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:53:28,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:53:28,190 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:53:28,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-22 21:53:28,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:28,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:53:28,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:53:28,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:53:28,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:53:28,198 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 3#L26true call main_#t~ret5 := g(main_~x~0);< 13#gENTRYtrue [2018-11-22 21:53:28,198 INFO L796 eck$LassoCheckResult]: Loop: 13#gENTRYtrue ~x := #in~x; 9#L19true assume !(~x <= 0); 7#L20true call #t~ret2 := f(~x - 1);< 14#fENTRYtrue ~x := #in~x; 18#L13true assume !(~x <= 0); 15#L14true call #t~ret0 := g(~x);< 13#gENTRYtrue [2018-11-22 21:53:28,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1583, now seen corresponding path program 1 times [2018-11-22 21:53:28,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:28,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1158035901, now seen corresponding path program 1 times [2018-11-22 21:53:28,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:28,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash 734553451, now seen corresponding path program 1 times [2018-11-22 21:53:28,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:28,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:28,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:28,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:28,431 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:53:28,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:53:28,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:53:28,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:53:28,432 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 21:53:28,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:53:28,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:53:28,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:53:28,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-22 21:53:28,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:53:28,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:53:28,452 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-22 21:53:28,458 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-22 21:53:28,466 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-22 21:53:28,471 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-22 21:53:28,474 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-22 21:53:28,485 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-22 21:53:28,487 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-22 21:53:28,489 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-22 21:53:28,491 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-22 21:53:28,494 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-22 21:53:28,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:53:28,578 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:53:28,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:53:28,596 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 21:53:28,596 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:53:28,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:53:28,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 21:53:28,631 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:53:28,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:53:28,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 21:53:28,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:53:28,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:53:28,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 21:53:28,675 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_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:53:28,692 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/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-22 21:53:28,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 21:53:28,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:53:28,759 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 21:53:28,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:53:28,761 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:53:28,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:53:28,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:53:28,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:53:28,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:53:28,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:53:28,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:53:28,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-22 21:53:28,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:53:28,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:53:28,763 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-22 21:53:28,765 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-22 21:53:28,770 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-22 21:53:28,772 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-22 21:53:28,774 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-22 21:53:28,776 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-22 21:53:28,777 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-22 21:53:28,783 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-22 21:53:28,786 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-22 21:53:28,788 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-22 21:53:28,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:53:28,838 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:53:28,840 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-22 21:53:28,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,847 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-22 21:53:28,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,851 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-22 21:53:28,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,854 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-22 21:53:28,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,857 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-22 21:53:28,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,860 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-22 21:53:28,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:53:28,864 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-22 21:53:28,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:53:28,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:53:28,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:53:28,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:53:28,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:53:28,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:53:28,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:53:28,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:53:28,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:53:28,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:53:28,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:53:28,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:53:28,876 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:53:28,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2018-11-22 21:53:28,877 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 21:53:28,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:28,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:53:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:28,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:53:29,000 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-22 21:53:29,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-22 21:53:29,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 6 states. [2018-11-22 21:53:29,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 6 states. Result 62 states and 81 transitions. Complement of second has 24 states. [2018-11-22 21:53:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-22 21:53:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-22 21:53:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2018-11-22 21:53:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-22 21:53:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:53:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 21:53:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:53:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-22 21:53:29,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:53:29,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2018-11-22 21:53:29,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:29,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 45 states and 59 transitions. [2018-11-22 21:53:29,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-22 21:53:29,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 21:53:29,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2018-11-22 21:53:29,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:53:29,296 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-22 21:53:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2018-11-22 21:53:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-22 21:53:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:53:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-22 21:53:29,324 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-22 21:53:29,325 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-22 21:53:29,325 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:53:29,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2018-11-22 21:53:29,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:29,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:53:29,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:53:29,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:29,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:29,328 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 159#L26 call main_#t~ret5 := g(main_~x~0);< 160#gENTRY ~x := #in~x; 186#L19 assume !(~x <= 0); 168#L20 call #t~ret2 := f(~x - 1);< 173#fENTRY ~x := #in~x; 196#L13 assume !(~x <= 0); 162#L14 call #t~ret0 := g(~x);< 187#gENTRY ~x := #in~x; 177#L19 assume ~x <= 0;#res := 0; 161#gFINAL assume true; 163#gEXIT >#26#return; 171#L14-1 [2018-11-22 21:53:29,329 INFO L796 eck$LassoCheckResult]: Loop: 171#L14-1 call #t~ret1 := g(1 + ~x);< 192#gENTRY ~x := #in~x; 200#L19 assume !(~x <= 0); 191#L20 call #t~ret2 := f(~x - 1);< 181#fENTRY ~x := #in~x; 197#L13 assume !(~x <= 0); 180#L14 call #t~ret0 := g(~x);< 192#gENTRY ~x := #in~x; 200#L19 assume ~x <= 0;#res := 0; 184#gFINAL assume true; 202#gEXIT >#26#return; 171#L14-1 [2018-11-22 21:53:29,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1661600137, now seen corresponding path program 1 times [2018-11-22 21:53:29,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:29,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:29,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:29,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:53:29,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:29,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:53:29,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:53:29,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1499912510, now seen corresponding path program 1 times [2018-11-22 21:53:29,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:53:29,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:29,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:53:29,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:53:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:53:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:53:29,450 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-22 21:53:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:29,488 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-22 21:53:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:53:29,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2018-11-22 21:53:29,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:29,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 44 states and 55 transitions. [2018-11-22 21:53:29,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 21:53:29,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 21:53:29,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2018-11-22 21:53:29,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:53:29,493 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-22 21:53:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2018-11-22 21:53:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-22 21:53:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:53:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-22 21:53:29,497 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-22 21:53:29,497 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-22 21:53:29,497 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:53:29,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2018-11-22 21:53:29,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:53:29,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:53:29,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:53:29,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:29,500 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:29,500 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 264#L26 call main_#t~ret5 := g(main_~x~0);< 265#gENTRY ~x := #in~x; 288#L19 assume !(~x <= 0); 276#L20 call #t~ret2 := f(~x - 1);< 281#fENTRY ~x := #in~x; 294#L13 assume !(~x <= 0); 269#L14 call #t~ret0 := g(~x);< 291#gENTRY ~x := #in~x; 287#L19 assume !(~x <= 0); 279#L20 call #t~ret2 := f(~x - 1);< 280#fENTRY ~x := #in~x; 306#L13 assume ~x <= 0;#res := 0; 305#fFINAL assume true; 282#fEXIT >#30#return; 272#L20-1 call #t~ret3 := f(~x - 2);< 285#fENTRY ~x := #in~x; 293#L13 assume ~x <= 0;#res := 0; 271#fFINAL assume true; 273#fEXIT >#32#return; 289#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 266#gFINAL assume true; 270#gEXIT >#26#return; 267#L14-1 [2018-11-22 21:53:29,500 INFO L796 eck$LassoCheckResult]: Loop: 267#L14-1 call #t~ret1 := g(1 + ~x);< 297#gENTRY ~x := #in~x; 304#L19 assume !(~x <= 0); 295#L20 call #t~ret2 := f(~x - 1);< 302#fENTRY ~x := #in~x; 300#L13 assume !(~x <= 0); 268#L14 call #t~ret0 := g(~x);< 297#gENTRY ~x := #in~x; 304#L19 assume !(~x <= 0); 295#L20 call #t~ret2 := f(~x - 1);< 302#fENTRY ~x := #in~x; 300#L13 assume ~x <= 0;#res := 0; 301#fFINAL assume true; 307#fEXIT >#30#return; 296#L20-1 call #t~ret3 := f(~x - 2);< 302#fENTRY ~x := #in~x; 300#L13 assume ~x <= 0;#res := 0; 301#fFINAL assume true; 307#fEXIT >#32#return; 289#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 266#gFINAL assume true; 270#gEXIT >#26#return; 267#L14-1 [2018-11-22 21:53:29,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1603563642, now seen corresponding path program 1 times [2018-11-22 21:53:29,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:29,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1170922075, now seen corresponding path program 1 times [2018-11-22 21:53:29,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:29,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash 878037024, now seen corresponding path program 1 times [2018-11-22 21:53:29,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] CALL call main_#t~ret5 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + ~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- [2018-11-22 21:53:29,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:53:29 BoogieIcfgContainer [2018-11-22 21:53:29,973 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:53:29,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:53:29,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:53:29,973 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:53:29,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:28" (3/4) ... [2018-11-22 21:53:29,976 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~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] CALL call main_#t~ret5 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + ~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- [2018-11-22 21:53:30,023 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a825427b-c27e-46e5-9f56-f49a3282b5fe/bin-2019/uautomizer/witness.graphml [2018-11-22 21:53:30,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:53:30,024 INFO L168 Benchmark]: Toolchain (without parser) took 2375.85 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.1 MB in the beginning and 862.3 MB in the end (delta: 96.8 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,026 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:53:30,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,027 INFO L168 Benchmark]: Boogie Preprocessor took 12.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:53:30,027 INFO L168 Benchmark]: RCFGBuilder took 188.13 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.7 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,027 INFO L168 Benchmark]: BuchiAutomizer took 1868.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.7 MB in the end (delta: 247.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,028 INFO L168 Benchmark]: Witness Printer took 50.33 ms. Allocated memory is still 1.2 GB. Free memory was 865.7 MB in the beginning and 862.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:30,030 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 221.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 30.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.13 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.7 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1868.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.7 MB in the end (delta: 247.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. * Witness Printer took 50.33 ms. Allocated memory is still 1.2 GB. Free memory was 865.7 MB in the beginning and 862.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 22 SDslu, 41 SDs, 0 SdLazy, 81 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 14]: 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@38fb6494=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c59037d=0, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72727d3a=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d075358=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34baa3e1=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73fa3d=0, NULL=0, x=1, \result=0, \old(x)=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] CALL call main_#t~ret5 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + ~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; [?] CALL call main_#t~ret5 := g(main_~x~0); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~x~0; [L25] main_~x~0 := main_#t~nondet4; [L25] havoc main_#t~nondet4; [L26] CALL call main_#t~ret5 := g(main_~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L25] ~x~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] CALL call #t~ret5 := g(~x~0); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call #t~ret1 := g(1 + ~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret0 := g(~x); [?] ~x := #in~x; [?] assume !(~x <= 0); [?] CALL call #t~ret2 := f(~x - 1); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := f(~x - 2); [?] ~x := #in~x; [?] assume ~x <= 0;#res := 0; [?] assume true; [?] RET #32#return; [?] #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; [?] assume true; [?] RET #26#return; [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume !(~x <= 0); [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19-L20] assume !(~x <= 0); [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13-L14] assume ~x <= 0; [L13] #res := 0; [L8] ensures true; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L9] ensures true; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] CALL call #t~ret1 := g(1 + ~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND FALSE !(~x <= 0) [L14] CALL call #t~ret0 := g(~x); [L17-L21] ~x := #in~x; [L19] COND FALSE !(~x <= 0) [L20] CALL call #t~ret2 := f(~x - 1); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret2 := f(~x - 1); [L20] CALL call #t~ret3 := f(~x - 2); [L11-L15] ~x := #in~x; [L13] COND TRUE ~x <= 0 [L13] #res := 0; [L20] RET call #t~ret3 := f(~x - 2); [L20] #res := #t~ret2 + #t~ret3; [L20] havoc #t~ret2; [L20] havoc #t~ret3; [L14] RET call #t~ret0 := g(~x); [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) Loop: [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...