./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:43:47,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:43:47,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:43:47,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:43:47,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:43:47,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:43:47,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:43:47,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:43:47,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:43:47,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:43:47,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:43:47,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:43:47,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:43:47,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:43:47,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:43:47,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:43:47,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:43:47,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:43:47,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:43:47,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:43:47,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:43:47,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:43:47,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:43:47,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:43:47,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:43:47,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:43:47,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:43:47,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:43:47,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:43:47,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:43:47,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:43:47,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:43:47,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:43:47,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:43:47,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:43:47,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:43:47,236 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:43:47,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:43:47,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:43:47,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:43:47,249 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:43:47,249 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:43:47,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:43:47,249 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:43:47,250 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:43:47,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:43:47,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:43:47,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:43:47,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:43:47,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:43:47,253 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:43:47,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:43:47,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:43:47,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:43:47,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:43:47,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:43:47,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:43:47,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:43:47,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:43:47,255 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2018-11-23 02:43:47,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:43:47,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:43:47,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:43:47,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:43:47,296 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:43:47,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-11-23 02:43:47,355 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/data/44f9a8d2d/642f6290771e450294f78dffc53c1173/FLAGc4b9222a8 [2018-11-23 02:43:47,748 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:43:47,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-11-23 02:43:47,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/data/44f9a8d2d/642f6290771e450294f78dffc53c1173/FLAGc4b9222a8 [2018-11-23 02:43:47,763 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/data/44f9a8d2d/642f6290771e450294f78dffc53c1173 [2018-11-23 02:43:47,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:43:47,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:43:47,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:43:47,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:43:47,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:43:47,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9989bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47, skipping insertion in model container [2018-11-23 02:43:47,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:43:47,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:43:47,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:43:47,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:43:47,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:43:47,942 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:43:47,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47 WrapperNode [2018-11-23 02:43:47,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:43:47,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:43:47,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:43:47,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:43:47,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:43:47,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:43:47,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:43:47,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:43:47,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... [2018-11-23 02:43:47,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:43:47,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:43:47,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:43:47,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:43:47,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:43:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:43:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:43:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:43:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:43:48,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:43:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:43:48,073 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-23 02:43:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-23 02:43:48,073 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-23 02:43:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-23 02:43:48,200 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:43:48,201 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:43:48,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:43:48 BoogieIcfgContainer [2018-11-23 02:43:48,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:43:48,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:43:48,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:43:48,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:43:48,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:43:47" (1/3) ... [2018-11-23 02:43:48,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:43:48, skipping insertion in model container [2018-11-23 02:43:48,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:43:47" (2/3) ... [2018-11-23 02:43:48,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:43:48, skipping insertion in model container [2018-11-23 02:43:48,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:43:48" (3/3) ... [2018-11-23 02:43:48,207 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-11-23 02:43:48,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:43:48,221 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:43:48,233 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:43:48,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:43:48,257 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:43:48,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:43:48,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:43:48,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:43:48,258 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:43:48,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:43:48,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:43:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 02:43:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:43:48,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:48,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:48,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:48,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-23 02:43:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:43:48,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:43:48,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:43:48,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:43:48,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:43:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:43:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:43:48,437 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-23 02:43:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:48,507 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 02:43:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:43:48,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 02:43:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:48,514 INFO L225 Difference]: With dead ends: 44 [2018-11-23 02:43:48,514 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 02:43:48,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:43:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 02:43:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 02:43:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:43:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 02:43:48,545 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-23 02:43:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:48,546 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 02:43:48,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:43:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 02:43:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 02:43:48,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:48,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:48,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:48,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-23 02:43:48,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:43:48,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:43:48,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:43:48,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:43:48,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:43:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:43:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:43:48,585 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-23 02:43:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:48,655 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 02:43:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:43:48,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 02:43:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:48,656 INFO L225 Difference]: With dead ends: 36 [2018-11-23 02:43:48,656 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 02:43:48,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:43:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 02:43:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 02:43:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:43:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 02:43:48,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-23 02:43:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:48,663 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 02:43:48,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:43:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 02:43:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:43:48,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:48,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:48,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:48,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-23 02:43:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:48,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:43:48,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:43:48,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:43:48,753 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-23 02:43:48,754 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-23 02:43:48,782 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:43:48,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:43:48,868 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:43:48,869 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-23 02:43:48,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:48,875 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:43:48,912 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 02:43:48,912 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:43:48,937 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-23 02:43:48,938 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:43:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:43:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 02:43:48,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:43:48,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:43:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:43:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:43:48,939 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-23 02:43:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:49,115 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-23 02:43:49,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:43:49,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 02:43:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:49,116 INFO L225 Difference]: With dead ends: 72 [2018-11-23 02:43:49,116 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:43:49,116 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:43:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:43:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 02:43:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:43:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-23 02:43:49,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-23 02:43:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:49,122 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-23 02:43:49,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:43:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 02:43:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 02:43:49,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:49,123 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:49,124 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-23 02:43:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:49,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:43:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:43:49,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:43:49,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 02:43:49,177 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 02:43:49,178 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:43:49,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:43:49,463 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:43:49,463 INFO L272 AbstractInterpreter]: Visited 28 different actions 896 times. Never merged. Widened at 4 different actions 65 times. Performed 1872 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 95 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-23 02:43:49,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:49,477 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:43:49,488 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 02:43:49,489 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:43:49,515 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-23 02:43:49,516 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:43:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:43:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-23 02:43:49,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:43:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:43:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:43:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:43:49,517 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-23 02:43:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:49,710 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-23 02:43:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:43:49,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 02:43:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:49,711 INFO L225 Difference]: With dead ends: 87 [2018-11-23 02:43:49,711 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 02:43:49,712 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:43:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 02:43:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 02:43:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 02:43:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-23 02:43:49,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-23 02:43:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:49,720 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 02:43:49,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:43:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 02:43:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 02:43:49,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:49,722 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:49,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:49,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-23 02:43:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:49,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 02:43:49,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:43:49,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:43:49,794 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:43:49,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:43:49,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:43:49,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:43:49,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:43:49,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:43:49,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:43:49,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:43:49,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:43:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:43:49,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:43:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:43:50,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:43:50,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-23 02:43:50,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:43:50,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:43:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:43:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:43:50,164 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-23 02:43:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:50,323 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-23 02:43:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:43:50,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 02:43:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:50,326 INFO L225 Difference]: With dead ends: 121 [2018-11-23 02:43:50,326 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 02:43:50,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-23 02:43:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 02:43:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-23 02:43:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 02:43:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-23 02:43:50,337 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-23 02:43:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:50,338 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-23 02:43:50,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:43:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-23 02:43:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 02:43:50,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:50,339 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:50,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:50,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:50,340 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-23 02:43:50,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:43:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:50,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:43:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:43:50,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:43:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 02:43:50,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:43:50,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:43:50,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-23 02:43:50,396 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 02:43:50,408 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:43:50,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:43:59,886 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:43:59,887 INFO L272 AbstractInterpreter]: Visited 29 different actions 61447 times. Merged at 11 different actions 16389 times. Widened at 4 different actions 3048 times. Performed 145554 root evaluator evaluations with a maximum evaluation depth of 4. Performed 145554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7200 fixpoints after 10 different actions. Largest state had 5 variables. [2018-11-23 02:43:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:59,889 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:43:59,902 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-11-23 02:43:59,903 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:43:59,978 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-23 02:43:59,979 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:43:59,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:43:59,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-23 02:43:59,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:43:59,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:43:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:43:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:43:59,980 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-11-23 02:44:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:00,294 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-11-23 02:44:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:44:00,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 02:44:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:00,295 INFO L225 Difference]: With dead ends: 118 [2018-11-23 02:44:00,295 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 02:44:00,296 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:44:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 02:44:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 02:44:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 02:44:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-23 02:44:00,306 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-11-23 02:44:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:00,306 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-23 02:44:00,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:44:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-23 02:44:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 02:44:00,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:44:00,309 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:44:00,309 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:44:00,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-11-23 02:44:00,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:44:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:44:00,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:44:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:44:00,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:44:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 02:44:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:44:00,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:44:00,366 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-23 02:44:00,366 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 02:44:00,367 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:44:00,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:44:02,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:44:02,182 INFO L272 AbstractInterpreter]: Visited 29 different actions 20375 times. Merged at 11 different actions 5233 times. Widened at 3 different actions 1140 times. Performed 47351 root evaluator evaluations with a maximum evaluation depth of 4. Performed 47351 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2539 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-23 02:44:02,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:02,186 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:44:02,197 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 02:44:02,197 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:44:02,247 INFO L415 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-11-23 02:44:02,247 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:44:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:44:02,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-23 02:44:02,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:44:02,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:44:02,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:44:02,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:44:02,248 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-11-23 02:44:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:02,563 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-11-23 02:44:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:44:02,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-23 02:44:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:02,565 INFO L225 Difference]: With dead ends: 141 [2018-11-23 02:44:02,566 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 02:44:02,566 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:44:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 02:44:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 02:44:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 02:44:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-23 02:44:02,582 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-11-23 02:44:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:02,583 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-23 02:44:02,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:44:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-23 02:44:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 02:44:02,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:44:02,585 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:44:02,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:44:02,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-11-23 02:44:02,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:44:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:44:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:44:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:44:02,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:44:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 02:44:02,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:44:02,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:44:02,674 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-23 02:44:02,674 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 02:44:02,676 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:44:02,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:47:44,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:47:44,158 INFO L272 AbstractInterpreter]: Visited 34 different actions 2187402 times. Merged at 14 different actions 690652 times. Widened at 4 different actions 72333 times. Performed 5379739 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5379739 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 310049 fixpoints after 10 different actions. Largest state had 5 variables. [2018-11-23 02:47:44,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:44,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:47:44,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:44,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:44,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:44,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:47:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:44,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 02:47:44,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 97 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 02:47:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:45,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 21 [2018-11-23 02:47:45,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:47:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:47:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:47:45,007 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 14 states. [2018-11-23 02:47:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:45,229 INFO L93 Difference]: Finished difference Result 231 states and 393 transitions. [2018-11-23 02:47:45,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:47:45,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-11-23 02:47:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:45,231 INFO L225 Difference]: With dead ends: 231 [2018-11-23 02:47:45,231 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 02:47:45,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-11-23 02:47:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 02:47:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-11-23 02:47:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 02:47:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-11-23 02:47:45,247 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 94 [2018-11-23 02:47:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:45,248 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-11-23 02:47:45,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:47:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-23 02:47:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 02:47:45,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:45,251 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 11, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:45,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:45,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -334045017, now seen corresponding path program 1 times [2018-11-23 02:47:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:45,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 99 proven. 184 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-11-23 02:47:45,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:45,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:45,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-23 02:47:45,362 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 02:47:45,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:47:45,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:47:47,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:47:47,739 INFO L272 AbstractInterpreter]: Visited 29 different actions 27744 times. Merged at 11 different actions 6710 times. Widened at 4 different actions 1741 times. Performed 67575 root evaluator evaluations with a maximum evaluation depth of 4. Performed 67575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3522 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-23 02:47:47,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:47,742 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:47:47,760 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 56.31% of their original sizes. [2018-11-23 02:47:47,761 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:47:47,894 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-23 02:47:47,894 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:47:47,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:47:47,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [11] total 33 [2018-11-23 02:47:47,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:47:47,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 02:47:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 02:47:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:47:47,895 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 24 states. [2018-11-23 02:47:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:48,603 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2018-11-23 02:47:48,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 02:47:48,604 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-23 02:47:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:48,604 INFO L225 Difference]: With dead ends: 223 [2018-11-23 02:47:48,605 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 02:47:48,605 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 02:47:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 02:47:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-11-23 02:47:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 02:47:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-11-23 02:47:48,618 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 175 [2018-11-23 02:47:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:48,619 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-11-23 02:47:48,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 02:47:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-23 02:47:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-23 02:47:48,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:48,621 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 13, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:48,621 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:48,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1327733822, now seen corresponding path program 2 times [2018-11-23 02:47:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:48,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:48,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 286 proven. 12 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-23 02:47:48,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:48,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:48,749 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:48,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:48,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:48,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:48,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:48,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:47:48,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 02:47:48,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:48,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 301 proven. 3 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2018-11-23 02:47:48,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2018-11-23 02:47:49,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:49,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-11-23 02:47:49,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:49,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:47:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:47:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-23 02:47:49,208 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 16 states. [2018-11-23 02:47:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:49,365 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2018-11-23 02:47:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:47:49,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-11-23 02:47:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:49,367 INFO L225 Difference]: With dead ends: 255 [2018-11-23 02:47:49,368 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 02:47:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 418 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-11-23 02:47:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 02:47:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2018-11-23 02:47:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 02:47:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2018-11-23 02:47:49,378 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 215 [2018-11-23 02:47:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2018-11-23 02:47:49,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:47:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2018-11-23 02:47:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-23 02:47:49,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:49,382 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:49,382 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:49,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1584661804, now seen corresponding path program 2 times [2018-11-23 02:47:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:49,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:49,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 137 proven. 322 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2018-11-23 02:47:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:49,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:49,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:49,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:49,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:49,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:47:49,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 02:47:49,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:49,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 433 proven. 37 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-11-23 02:47:49,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 433 proven. 38 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2018-11-23 02:47:50,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:50,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 23 [2018-11-23 02:47:50,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:50,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:47:50,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:47:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:47:50,185 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand 18 states. [2018-11-23 02:47:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:50,601 INFO L93 Difference]: Finished difference Result 330 states and 563 transitions. [2018-11-23 02:47:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 02:47:50,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 245 [2018-11-23 02:47:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:50,605 INFO L225 Difference]: With dead ends: 330 [2018-11-23 02:47:50,607 INFO L226 Difference]: Without dead ends: 207 [2018-11-23 02:47:50,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 469 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 02:47:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-23 02:47:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2018-11-23 02:47:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 02:47:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 258 transitions. [2018-11-23 02:47:50,631 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 258 transitions. Word has length 245 [2018-11-23 02:47:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:50,631 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 258 transitions. [2018-11-23 02:47:50,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:47:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 258 transitions. [2018-11-23 02:47:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-23 02:47:50,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:50,634 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:50,634 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:50,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:50,634 INFO L82 PathProgramCache]: Analyzing trace with hash 479762797, now seen corresponding path program 2 times [2018-11-23 02:47:50,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:50,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:50,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 284 proven. 111 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-11-23 02:47:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:50,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:50,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:50,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:50,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:50,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:50,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:50,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:47:50,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 02:47:50,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:50,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 288 proven. 53 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2018-11-23 02:47:50,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:52,065 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-23 02:47:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 290 proven. 56 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-23 02:47:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 21 [2018-11-23 02:47:52,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:52,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:47:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:47:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:47:52,149 INFO L87 Difference]: Start difference. First operand 186 states and 258 transitions. Second operand 16 states. [2018-11-23 02:47:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:52,506 INFO L93 Difference]: Finished difference Result 419 states and 651 transitions. [2018-11-23 02:47:52,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 02:47:52,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 257 [2018-11-23 02:47:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:52,511 INFO L225 Difference]: With dead ends: 419 [2018-11-23 02:47:52,511 INFO L226 Difference]: Without dead ends: 256 [2018-11-23 02:47:52,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 497 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 02:47:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-23 02:47:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 212. [2018-11-23 02:47:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 02:47:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2018-11-23 02:47:52,539 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 257 [2018-11-23 02:47:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:52,539 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2018-11-23 02:47:52,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:47:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2018-11-23 02:47:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-23 02:47:52,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:52,543 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 22, 22, 18, 17, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 10, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:52,543 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -985772355, now seen corresponding path program 3 times [2018-11-23 02:47:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:52,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:52,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 164 proven. 448 refuted. 0 times theorem prover too weak. 2537 trivial. 0 not checked. [2018-11-23 02:47:52,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:52,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:52,665 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:52,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:52,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:52,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:52,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:47:52,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:47:52,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:47:52,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:52,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 127 proven. 756 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2018-11-23 02:47:52,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 127 proven. 789 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2018-11-23 02:47:54,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:54,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 19] total 28 [2018-11-23 02:47:54,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:54,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 02:47:54,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:47:54,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-11-23 02:47:54,266 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand 19 states. [2018-11-23 02:47:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:54,655 INFO L93 Difference]: Finished difference Result 586 states and 1078 transitions. [2018-11-23 02:47:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 02:47:54,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 336 [2018-11-23 02:47:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:54,659 INFO L225 Difference]: With dead ends: 586 [2018-11-23 02:47:54,659 INFO L226 Difference]: Without dead ends: 355 [2018-11-23 02:47:54,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 638 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 02:47:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-23 02:47:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 257. [2018-11-23 02:47:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 02:47:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 401 transitions. [2018-11-23 02:47:54,687 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 401 transitions. Word has length 336 [2018-11-23 02:47:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:54,688 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 401 transitions. [2018-11-23 02:47:54,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 02:47:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 401 transitions. [2018-11-23 02:47:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-11-23 02:47:54,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:54,692 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 38, 38, 32, 31, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 12, 12, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:54,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:54,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash 452673448, now seen corresponding path program 4 times [2018-11-23 02:47:54,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:54,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:54,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 319 proven. 1256 refuted. 0 times theorem prover too weak. 6922 trivial. 0 not checked. [2018-11-23 02:47:54,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:54,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:54,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:54,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:54,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:54,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:54,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:47:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:55,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 215 proven. 1539 refuted. 0 times theorem prover too weak. 6743 trivial. 0 not checked. [2018-11-23 02:47:55,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:47:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 215 proven. 1583 refuted. 0 times theorem prover too weak. 6699 trivial. 0 not checked. [2018-11-23 02:47:57,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:47:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 32 [2018-11-23 02:47:57,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:47:57,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 02:47:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 02:47:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-11-23 02:47:57,808 INFO L87 Difference]: Start difference. First operand 257 states and 401 transitions. Second operand 23 states. [2018-11-23 02:47:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:58,647 INFO L93 Difference]: Finished difference Result 749 states and 1482 transitions. [2018-11-23 02:47:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 02:47:58,647 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 544 [2018-11-23 02:47:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:58,651 INFO L225 Difference]: With dead ends: 749 [2018-11-23 02:47:58,651 INFO L226 Difference]: Without dead ends: 456 [2018-11-23 02:47:58,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1053 SyntacticMatches, 19 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=3382, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 02:47:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-23 02:47:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 396. [2018-11-23 02:47:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-23 02:47:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 668 transitions. [2018-11-23 02:47:58,677 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 668 transitions. Word has length 544 [2018-11-23 02:47:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 668 transitions. [2018-11-23 02:47:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 02:47:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 668 transitions. [2018-11-23 02:47:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2018-11-23 02:47:58,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:58,685 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 86, 86, 74, 68, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 31, 24, 18, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:58,685 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:47:58,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1283753402, now seen corresponding path program 5 times [2018-11-23 02:47:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:47:58,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:58,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:58,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:58,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:47:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42659 backedges. 2812 proven. 1525 refuted. 0 times theorem prover too weak. 38322 trivial. 0 not checked. [2018-11-23 02:47:59,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:59,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:47:59,904 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:47:59,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:47:59,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:59,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:59,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:48:00,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 02:48:00,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:00,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 42659 backedges. 3244 proven. 78 refuted. 0 times theorem prover too weak. 39337 trivial. 0 not checked. [2018-11-23 02:48:01,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:02,166 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 02:48:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 42659 backedges. 3244 proven. 83 refuted. 0 times theorem prover too weak. 39332 trivial. 0 not checked. [2018-11-23 02:48:04,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:04,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 31 [2018-11-23 02:48:04,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:04,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 02:48:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 02:48:04,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-11-23 02:48:04,630 INFO L87 Difference]: Start difference. First operand 396 states and 668 transitions. Second operand 25 states. [2018-11-23 02:48:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:05,355 INFO L93 Difference]: Finished difference Result 791 states and 1468 transitions. [2018-11-23 02:48:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 02:48:05,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1199 [2018-11-23 02:48:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:05,359 INFO L225 Difference]: With dead ends: 791 [2018-11-23 02:48:05,359 INFO L226 Difference]: Without dead ends: 418 [2018-11-23 02:48:05,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2439 GetRequests, 2378 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=2051, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 02:48:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-23 02:48:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 390. [2018-11-23 02:48:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-23 02:48:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 579 transitions. [2018-11-23 02:48:05,380 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 579 transitions. Word has length 1199 [2018-11-23 02:48:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:05,381 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 579 transitions. [2018-11-23 02:48:05,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 02:48:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 579 transitions. [2018-11-23 02:48:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2018-11-23 02:48:05,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:05,387 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 72, 67, 67, 59, 44, 44, 44, 44, 44, 44, 44, 39, 33, 33, 33, 33, 33, 33, 33, 16, 15, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:05,387 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:05,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 290719530, now seen corresponding path program 6 times [2018-11-23 02:48:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:05,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:05,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 34319 backedges. 717 proven. 1625 refuted. 0 times theorem prover too weak. 31977 trivial. 0 not checked. [2018-11-23 02:48:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:05,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:05,744 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:05,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:05,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:05,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:48:05,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:48:05,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:48:05,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:05,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34319 backedges. 702 proven. 2605 refuted. 0 times theorem prover too weak. 31012 trivial. 0 not checked. [2018-11-23 02:48:06,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34319 backedges. 704 proven. 2636 refuted. 0 times theorem prover too weak. 30979 trivial. 0 not checked. [2018-11-23 02:48:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 19] total 24 [2018-11-23 02:48:08,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:08,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:48:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:48:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:48:08,547 INFO L87 Difference]: Start difference. First operand 390 states and 579 transitions. Second operand 16 states. [2018-11-23 02:48:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:08,809 INFO L93 Difference]: Finished difference Result 881 states and 1572 transitions. [2018-11-23 02:48:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:48:08,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1068 [2018-11-23 02:48:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:08,814 INFO L225 Difference]: With dead ends: 881 [2018-11-23 02:48:08,814 INFO L226 Difference]: Without dead ends: 490 [2018-11-23 02:48:08,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2153 GetRequests, 2103 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 02:48:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-11-23 02:48:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 390. [2018-11-23 02:48:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-23 02:48:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 600 transitions. [2018-11-23 02:48:08,858 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 600 transitions. Word has length 1068 [2018-11-23 02:48:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:08,858 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 600 transitions. [2018-11-23 02:48:08,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:48:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 600 transitions. [2018-11-23 02:48:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2018-11-23 02:48:08,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:08,871 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 79, 79, 66, 63, 43, 43, 43, 43, 43, 43, 43, 39, 39, 39, 39, 39, 39, 39, 27, 20, 20, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:08,871 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:08,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash -75544313, now seen corresponding path program 7 times [2018-11-23 02:48:08,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:08,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:08,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 37618 backedges. 1005 proven. 1769 refuted. 0 times theorem prover too weak. 34844 trivial. 0 not checked. [2018-11-23 02:48:09,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:09,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:09,436 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:09,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:09,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:09,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:09,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:09,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:48:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:09,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 37618 backedges. 792 proven. 2683 refuted. 0 times theorem prover too weak. 34143 trivial. 0 not checked. [2018-11-23 02:48:10,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 37618 backedges. 794 proven. 2714 refuted. 0 times theorem prover too weak. 34110 trivial. 0 not checked. [2018-11-23 02:48:12,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:12,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 19] total 26 [2018-11-23 02:48:12,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:12,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:48:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:48:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-11-23 02:48:12,337 INFO L87 Difference]: Start difference. First operand 390 states and 600 transitions. Second operand 18 states. [2018-11-23 02:48:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:12,671 INFO L93 Difference]: Finished difference Result 899 states and 1666 transitions. [2018-11-23 02:48:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 02:48:12,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1126 [2018-11-23 02:48:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:12,675 INFO L225 Difference]: With dead ends: 899 [2018-11-23 02:48:12,675 INFO L226 Difference]: Without dead ends: 485 [2018-11-23 02:48:12,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2275 GetRequests, 2221 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 02:48:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-23 02:48:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 376. [2018-11-23 02:48:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 02:48:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 551 transitions. [2018-11-23 02:48:12,698 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 551 transitions. Word has length 1126 [2018-11-23 02:48:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:12,699 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 551 transitions. [2018-11-23 02:48:12,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:48:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 551 transitions. [2018-11-23 02:48:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2018-11-23 02:48:12,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:12,706 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 73, 69, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 30, 25, 18, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:12,707 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:12,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1780527666, now seen corresponding path program 8 times [2018-11-23 02:48:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:12,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:12,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42646 backedges. 1749 proven. 3016 refuted. 0 times theorem prover too weak. 37881 trivial. 0 not checked. [2018-11-23 02:48:13,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:13,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:13,226 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:13,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:13,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:13,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:13,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:48:13,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:48:13,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-23 02:48:13,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:13,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 42646 backedges. 6979 proven. 63 refuted. 0 times theorem prover too weak. 35604 trivial. 0 not checked. [2018-11-23 02:48:13,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42646 backedges. 2933 proven. 191 refuted. 0 times theorem prover too weak. 39522 trivial. 0 not checked. [2018-11-23 02:48:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:15,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 25 [2018-11-23 02:48:15,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:15,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 02:48:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:48:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:48:15,552 INFO L87 Difference]: Start difference. First operand 376 states and 551 transitions. Second operand 20 states. [2018-11-23 02:48:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:15,946 INFO L93 Difference]: Finished difference Result 778 states and 1289 transitions. [2018-11-23 02:48:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 02:48:15,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1199 [2018-11-23 02:48:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:15,950 INFO L225 Difference]: With dead ends: 778 [2018-11-23 02:48:15,951 INFO L226 Difference]: Without dead ends: 432 [2018-11-23 02:48:15,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2433 GetRequests, 2382 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 02:48:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-23 02:48:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 391. [2018-11-23 02:48:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-11-23 02:48:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2018-11-23 02:48:15,987 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 1199 [2018-11-23 02:48:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:15,988 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2018-11-23 02:48:15,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 02:48:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2018-11-23 02:48:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1798 [2018-11-23 02:48:16,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:16,008 INFO L402 BasicCegarLoop]: trace histogram [134, 134, 129, 129, 106, 106, 67, 67, 67, 67, 67, 67, 67, 64, 64, 64, 64, 64, 64, 64, 42, 39, 28, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:16,008 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:16,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:16,008 INFO L82 PathProgramCache]: Analyzing trace with hash 881979256, now seen corresponding path program 9 times [2018-11-23 02:48:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:16,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:16,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 96706 backedges. 3778 proven. 3946 refuted. 0 times theorem prover too weak. 88982 trivial. 0 not checked. [2018-11-23 02:48:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:17,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:17,165 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:17,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:17,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:48:17,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:48:17,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:48:17,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:17,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 96706 backedges. 1390 proven. 5231 refuted. 0 times theorem prover too weak. 90085 trivial. 0 not checked. [2018-11-23 02:48:18,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96706 backedges. 1388 proven. 5273 refuted. 0 times theorem prover too weak. 90045 trivial. 0 not checked. [2018-11-23 02:48:22,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:22,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 22] total 39 [2018-11-23 02:48:22,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:22,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 02:48:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 02:48:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 02:48:22,455 INFO L87 Difference]: Start difference. First operand 391 states and 601 transitions. Second operand 29 states. [2018-11-23 02:48:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:23,457 INFO L93 Difference]: Finished difference Result 1029 states and 1952 transitions. [2018-11-23 02:48:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 02:48:23,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1797 [2018-11-23 02:48:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:23,462 INFO L225 Difference]: With dead ends: 1029 [2018-11-23 02:48:23,463 INFO L226 Difference]: Without dead ends: 357 [2018-11-23 02:48:23,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3645 GetRequests, 3558 SyntacticMatches, 19 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=731, Invalid=4099, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 02:48:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-23 02:48:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 340. [2018-11-23 02:48:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-23 02:48:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 461 transitions. [2018-11-23 02:48:23,492 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 461 transitions. Word has length 1797 [2018-11-23 02:48:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 461 transitions. [2018-11-23 02:48:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 02:48:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 461 transitions. [2018-11-23 02:48:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2018-11-23 02:48:23,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:23,500 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 73, 73, 64, 61, 40, 40, 40, 40, 40, 40, 40, 36, 36, 36, 36, 36, 36, 36, 25, 24, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:23,501 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 360516039, now seen corresponding path program 10 times [2018-11-23 02:48:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:23,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:23,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32638 backedges. 1235 proven. 1441 refuted. 0 times theorem prover too weak. 29962 trivial. 0 not checked. [2018-11-23 02:48:24,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:24,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:24,089 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:24,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:24,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:24,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:24,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:48:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:24,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32638 backedges. 1055 proven. 2176 refuted. 0 times theorem prover too weak. 29407 trivial. 0 not checked. [2018-11-23 02:48:24,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32638 backedges. 1059 proven. 2205 refuted. 0 times theorem prover too weak. 29374 trivial. 0 not checked. [2018-11-23 02:48:26,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:26,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 29 [2018-11-23 02:48:26,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:26,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 02:48:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 02:48:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-11-23 02:48:26,914 INFO L87 Difference]: Start difference. First operand 340 states and 461 transitions. Second operand 21 states. [2018-11-23 02:48:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:27,463 INFO L93 Difference]: Finished difference Result 774 states and 1136 transitions. [2018-11-23 02:48:27,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 02:48:27,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1050 [2018-11-23 02:48:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:27,466 INFO L225 Difference]: With dead ends: 774 [2018-11-23 02:48:27,466 INFO L226 Difference]: Without dead ends: 407 [2018-11-23 02:48:27,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2136 GetRequests, 2068 SyntacticMatches, 17 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=2278, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 02:48:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-23 02:48:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2018-11-23 02:48:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-23 02:48:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2018-11-23 02:48:27,484 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 1050 [2018-11-23 02:48:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:27,484 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2018-11-23 02:48:27,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 02:48:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2018-11-23 02:48:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2018-11-23 02:48:27,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:27,491 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 84, 84, 72, 67, 44, 44, 44, 44, 44, 44, 44, 42, 42, 42, 42, 42, 42, 42, 30, 23, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:27,491 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1228369213, now seen corresponding path program 11 times [2018-11-23 02:48:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:27,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 41603 backedges. 1912 proven. 1884 refuted. 0 times theorem prover too weak. 37807 trivial. 0 not checked. [2018-11-23 02:48:28,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:28,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:28,034 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:28,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:28,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:28,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:48:28,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:48:28,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 02:48:28,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 41603 backedges. 3397 proven. 96 refuted. 0 times theorem prover too weak. 38110 trivial. 0 not checked. [2018-11-23 02:48:28,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 41603 backedges. 3397 proven. 99 refuted. 0 times theorem prover too weak. 38107 trivial. 0 not checked. [2018-11-23 02:48:30,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:30,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 25 [2018-11-23 02:48:30,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:30,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 02:48:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:48:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:48:30,473 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand 19 states. [2018-11-23 02:48:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:30,865 INFO L93 Difference]: Finished difference Result 605 states and 816 transitions. [2018-11-23 02:48:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 02:48:30,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1184 [2018-11-23 02:48:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:30,868 INFO L225 Difference]: With dead ends: 605 [2018-11-23 02:48:30,868 INFO L226 Difference]: Without dead ends: 382 [2018-11-23 02:48:30,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2405 GetRequests, 2348 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 02:48:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-23 02:48:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 350. [2018-11-23 02:48:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-23 02:48:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 457 transitions. [2018-11-23 02:48:30,895 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 457 transitions. Word has length 1184 [2018-11-23 02:48:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:30,896 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 457 transitions. [2018-11-23 02:48:30,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 02:48:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 457 transitions. [2018-11-23 02:48:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-11-23 02:48:30,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:30,906 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 65, 65, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 25, 25, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:30,906 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:30,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:30,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2089647827, now seen corresponding path program 12 times [2018-11-23 02:48:30,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:30,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:30,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1900 proven. 1071 refuted. 0 times theorem prover too weak. 33029 trivial. 0 not checked. [2018-11-23 02:48:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:31,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:31,507 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:31,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:31,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:48:31,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:48:31,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:48:31,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:31,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1510 proven. 1885 refuted. 0 times theorem prover too weak. 32605 trivial. 0 not checked. [2018-11-23 02:48:31,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1514 proven. 1914 refuted. 0 times theorem prover too weak. 32572 trivial. 0 not checked. [2018-11-23 02:48:34,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 19] total 23 [2018-11-23 02:48:34,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:34,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 02:48:34,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:48:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:48:34,322 INFO L87 Difference]: Start difference. First operand 350 states and 457 transitions. Second operand 15 states. [2018-11-23 02:48:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:34,532 INFO L93 Difference]: Finished difference Result 373 states and 489 transitions. [2018-11-23 02:48:34,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:48:34,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1103 [2018-11-23 02:48:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:34,535 INFO L225 Difference]: With dead ends: 373 [2018-11-23 02:48:34,535 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 02:48:34,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2232 GetRequests, 2184 SyntacticMatches, 17 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 02:48:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 02:48:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-11-23 02:48:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-23 02:48:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 443 transitions. [2018-11-23 02:48:34,560 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 443 transitions. Word has length 1103 [2018-11-23 02:48:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:34,561 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 443 transitions. [2018-11-23 02:48:34,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 02:48:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 443 transitions. [2018-11-23 02:48:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1594 [2018-11-23 02:48:34,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:34,579 INFO L402 BasicCegarLoop]: trace histogram [117, 117, 116, 116, 95, 93, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 37, 35, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:34,579 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:34,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1911184549, now seen corresponding path program 13 times [2018-11-23 02:48:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:34,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:34,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 75791 backedges. 1931 proven. 4504 refuted. 0 times theorem prover too weak. 69356 trivial. 0 not checked. [2018-11-23 02:48:35,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:35,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:35,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:35,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:35,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:35,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:35,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:48:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:35,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 75791 backedges. 1490 proven. 4352 refuted. 0 times theorem prover too weak. 69949 trivial. 0 not checked. [2018-11-23 02:48:36,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 75791 backedges. 1488 proven. 4394 refuted. 0 times theorem prover too weak. 69909 trivial. 0 not checked. [2018-11-23 02:48:39,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:39,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 22] total 34 [2018-11-23 02:48:39,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:39,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 02:48:39,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 02:48:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:48:39,984 INFO L87 Difference]: Start difference. First operand 351 states and 443 transitions. Second operand 24 states. [2018-11-23 02:48:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:40,495 INFO L93 Difference]: Finished difference Result 695 states and 901 transitions. [2018-11-23 02:48:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 02:48:40,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1593 [2018-11-23 02:48:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:40,497 INFO L225 Difference]: With dead ends: 695 [2018-11-23 02:48:40,498 INFO L226 Difference]: Without dead ends: 367 [2018-11-23 02:48:40,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3226 GetRequests, 3154 SyntacticMatches, 20 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 02:48:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-23 02:48:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 357. [2018-11-23 02:48:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-23 02:48:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 441 transitions. [2018-11-23 02:48:40,519 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 441 transitions. Word has length 1593 [2018-11-23 02:48:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:40,519 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 441 transitions. [2018-11-23 02:48:40,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 02:48:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 441 transitions. [2018-11-23 02:48:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2018-11-23 02:48:40,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:40,528 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 79, 77, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 31, 29, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:40,529 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:40,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1956673603, now seen corresponding path program 14 times [2018-11-23 02:48:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:40,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:48:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:40,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 51895 backedges. 4561 proven. 334 refuted. 0 times theorem prover too weak. 47000 trivial. 0 not checked. [2018-11-23 02:48:41,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:41,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:48:41,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:48:41,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:48:41,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:48:41,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:48:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:48:41,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:48:41,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 02:48:41,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:48:41,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:48:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 51895 backedges. 4035 proven. 161 refuted. 0 times theorem prover too weak. 47699 trivial. 0 not checked. [2018-11-23 02:48:41,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:48:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 51895 backedges. 4035 proven. 167 refuted. 0 times theorem prover too weak. 47693 trivial. 0 not checked. [2018-11-23 02:48:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:48:43,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 30 [2018-11-23 02:48:43,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:48:43,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 02:48:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 02:48:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-11-23 02:48:43,925 INFO L87 Difference]: Start difference. First operand 357 states and 441 transitions. Second operand 23 states. [2018-11-23 02:48:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:48:44,527 INFO L93 Difference]: Finished difference Result 402 states and 493 transitions. [2018-11-23 02:48:44,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 02:48:44,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1321 [2018-11-23 02:48:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:48:44,530 INFO L225 Difference]: With dead ends: 402 [2018-11-23 02:48:44,530 INFO L226 Difference]: Without dead ends: 384 [2018-11-23 02:48:44,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2694 GetRequests, 2619 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=583, Invalid=3199, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 02:48:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-23 02:48:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 346. [2018-11-23 02:48:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-23 02:48:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 423 transitions. [2018-11-23 02:48:44,547 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 423 transitions. Word has length 1321 [2018-11-23 02:48:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:48:44,548 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 423 transitions. [2018-11-23 02:48:44,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 02:48:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 423 transitions. [2018-11-23 02:48:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-11-23 02:48:44,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:48:44,557 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:48:44,557 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:48:44,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:48:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 15 times [2018-11-23 02:48:44,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:48:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:44,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:48:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:48:44,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:48:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:48:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:48:44,679 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 10; VAL [main_~x~0=10] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=10] [?] ~n := #in~n; VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] assume !(~n < 1); VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] assume !(1 == ~n); VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=9] [?] ~n := #in~n; VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] assume !(~n < 1); VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] assume !(1 == ~n); VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=8] [?] ~n := #in~n; VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] assume !(~n < 1); VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] assume !(1 == ~n); VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=7] [?] ~n := #in~n; VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] assume !(~n < 1); VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #53#return; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #55#return; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8, |fibo2_#t~ret3|=5] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#res|=13] [?] assume true; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#res|=13] [?] RET #57#return; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #59#return; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13, |fibo1_#t~ret1|=8] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#res|=21] [?] assume true; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#res|=21] [?] RET #53#return; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=7] [?] ~n := #in~n; VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(~n < 1); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #57#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #59#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8, |fibo1_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] assume true; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] RET #55#return; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21, |fibo2_#t~ret3|=13] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#res|=34] [?] assume true; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#res|=34] [?] RET #57#return; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=8] [?] ~n := #in~n; VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] assume !(~n < 1); VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] assume !(1 == ~n); VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=7] [?] ~n := #in~n; VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(~n < 1); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #57#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #59#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8, |fibo1_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] assume true; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] RET #53#return; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #55#return; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13, |fibo2_#t~ret3|=8] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#res|=21] [?] assume true; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#res|=21] [?] RET #59#return; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34, |fibo1_#t~ret1|=21] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#res|=55] [?] assume true; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#res|=55] [?] RET #51#return; VAL [main_~x~0=10, |main_#t~ret4|=55] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=55, main_~x~0=10] [?] assume 55 == ~result~0; VAL [main_~result~0=55, main_~x~0=10] [?] assume !false; VAL [main_~result~0=55, main_~x~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8-L14] assume !(~n < 1); VAL [#in~n=10, ~n=10] [L10-L14] assume !(1 == ~n); VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18-L24] assume !(~n < 1); VAL [#in~n=9, ~n=9] [L20-L24] assume !(1 == ~n); VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8-L14] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L10-L14] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18-L24] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L20-L24] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L5] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L4] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L5] ensures true; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18-L24] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L20-L24] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L5] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L4] ensures true; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38-L40] assume 55 == ~result~0; VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8-L14] assume !(~n < 1); VAL [#in~n=10, ~n=10] [L10-L14] assume !(1 == ~n); VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18-L24] assume !(~n < 1); VAL [#in~n=9, ~n=9] [L20-L24] assume !(1 == ~n); VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8-L14] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L10-L14] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18-L24] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L20-L24] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L5] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L4] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L5] ensures true; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18-L24] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L20-L24] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L5] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L4] ensures true; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38-L40] assume 55 == ~result~0; VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] ----- [2018-11-23 02:48:55,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:48:55 BoogieIcfgContainer [2018-11-23 02:48:55,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:48:55,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:48:55,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:48:55,460 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:48:55,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:43:48" (3/4) ... [2018-11-23 02:48:55,462 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 10; VAL [main_~x~0=10] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=10] [?] ~n := #in~n; VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] assume !(~n < 1); VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] assume !(1 == ~n); VAL [fibo1_~n=10, |fibo1_#in~n|=10] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=9] [?] ~n := #in~n; VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] assume !(~n < 1); VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] assume !(1 == ~n); VAL [fibo2_~n=9, |fibo2_#in~n|=9] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=8] [?] ~n := #in~n; VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] assume !(~n < 1); VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] assume !(1 == ~n); VAL [fibo1_~n=8, |fibo1_#in~n|=8] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=7] [?] ~n := #in~n; VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] assume !(~n < 1); VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo2_~n=7, |fibo2_#in~n|=7] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #53#return; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #55#return; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#t~ret2|=8, |fibo2_#t~ret3|=5] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#res|=13] [?] assume true; VAL [fibo2_~n=7, |fibo2_#in~n|=7, |fibo2_#res|=13] [?] RET #57#return; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #59#return; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#t~ret0|=13, |fibo1_#t~ret1|=8] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#res|=21] [?] assume true; VAL [fibo1_~n=8, |fibo1_#in~n|=8, |fibo1_#res|=21] [?] RET #53#return; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=7] [?] ~n := #in~n; VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(~n < 1); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #57#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #59#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8, |fibo1_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] assume true; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] RET #55#return; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#t~ret2|=21, |fibo2_#t~ret3|=13] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#res|=34] [?] assume true; VAL [fibo2_~n=9, |fibo2_#in~n|=9, |fibo2_#res|=34] [?] RET #57#return; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=8] [?] ~n := #in~n; VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] assume !(~n < 1); VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] assume !(1 == ~n); VAL [fibo2_~n=8, |fibo2_#in~n|=8] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=7] [?] ~n := #in~n; VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(~n < 1); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] assume !(1 == ~n); VAL [fibo1_~n=7, |fibo1_#in~n|=7] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=6] [?] ~n := #in~n; VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(~n < 1); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo2_~n=6, |fibo2_#in~n|=6] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #53#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #55#return; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#t~ret2|=5, |fibo2_#t~ret3|=3] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] assume true; VAL [fibo2_~n=6, |fibo2_#in~n|=6, |fibo2_#res|=8] [?] RET #57#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #59#return; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#t~ret0|=8, |fibo1_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] assume true; VAL [fibo1_~n=7, |fibo1_#in~n|=7, |fibo1_#res|=13] [?] RET #53#return; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #55#return; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#t~ret2|=13, |fibo2_#t~ret3|=8] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#res|=21] [?] assume true; VAL [fibo2_~n=8, |fibo2_#in~n|=8, |fibo2_#res|=21] [?] RET #59#return; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#t~ret0|=34, |fibo1_#t~ret1|=21] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#res|=55] [?] assume true; VAL [fibo1_~n=10, |fibo1_#in~n|=10, |fibo1_#res|=55] [?] RET #51#return; VAL [main_~x~0=10, |main_#t~ret4|=55] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=55, main_~x~0=10] [?] assume 55 == ~result~0; VAL [main_~result~0=55, main_~x~0=10] [?] assume !false; VAL [main_~result~0=55, main_~x~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8-L14] assume !(~n < 1); VAL [#in~n=10, ~n=10] [L10-L14] assume !(1 == ~n); VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18-L24] assume !(~n < 1); VAL [#in~n=9, ~n=9] [L20-L24] assume !(1 == ~n); VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8-L14] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L10-L14] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18-L24] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L20-L24] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L5] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L4] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L5] ensures true; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18-L24] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L20-L24] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L5] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L4] ensures true; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38-L40] assume 55 == ~result~0; VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8-L14] assume !(~n < 1); VAL [#in~n=10, ~n=10] [L10-L14] assume !(1 == ~n); VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18-L24] assume !(~n < 1); VAL [#in~n=9, ~n=9] [L20-L24] assume !(1 == ~n); VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8-L14] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L10-L14] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18-L24] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L20-L24] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L5] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L4] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L5] ensures true; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18-L24] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L20-L24] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8-L14] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L10-L14] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18-L24] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L20-L24] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L5] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L4] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L5] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L4] ensures true; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38-L40] assume 55 == ~result~0; VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 10; VAL [~x~0=10] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=10] [L7-L15] ~n := #in~n; VAL [#in~n=10, ~n=10] [L8] COND FALSE !(~n < 1) VAL [#in~n=10, ~n=10] [L10] COND FALSE !(1 == ~n) VAL [#in~n=10, ~n=10] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=9] [L17-L25] ~n := #in~n; VAL [#in~n=9, ~n=9] [L18] COND FALSE !(~n < 1) VAL [#in~n=9, ~n=9] [L20] COND FALSE !(1 == ~n) VAL [#in~n=9, ~n=9] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8] [L7-L15] ~n := #in~n; VAL [#in~n=8, ~n=8] [L8] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L10] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7] [L17-L25] ~n := #in~n; VAL [#in~n=7, ~n=7] [L18] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L20] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=7, #t~ret2=8, ~n=7] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7, #t~ret2=8, #t~ret3=5, ~n=7] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=7, #res=13, ~n=7] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=9, #t~ret2=21, ~n=9] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=9, #t~ret2=21, #t~ret3=13, ~n=9] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=9, #res=34, ~n=9] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=10, #t~ret0=34, ~n=10] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=8] [L17-L25] ~n := #in~n; VAL [#in~n=8, ~n=8] [L18] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L20] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=7] [L7-L15] ~n := #in~n; VAL [#in~n=7, ~n=7] [L8] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L10] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6] [L17-L25] ~n := #in~n; VAL [#in~n=6, ~n=6] [L18] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L20] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=6, #t~ret2=5, ~n=6] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6, #t~ret2=5, #t~ret3=3, ~n=6] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=6, #res=8, ~n=6] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=8, #t~ret2=13, ~n=8] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=8, #t~ret2=13, #t~ret3=8, ~n=8] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=8, #res=21, ~n=8] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=10, #t~ret0=34, #t~ret1=21, ~n=10] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=10, #res=55, ~n=10] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=55, ~x~0=10] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=55, ~x~0=10] [L38] COND TRUE 55 == ~result~0 VAL [~result~0=55, ~x~0=10] [L39] assert false; VAL [~result~0=55, ~x~0=10] [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] ----- [2018-11-23 02:49:27,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4feddd43-039f-4d12-94bf-26bfd1586b20/bin-2019/utaipan/witness.graphml [2018-11-23 02:49:27,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:49:27,401 INFO L168 Benchmark]: Toolchain (without parser) took 339635.23 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 960.3 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,402 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:27,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.67 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,402 INFO L168 Benchmark]: Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:27,403 INFO L168 Benchmark]: RCFGBuilder took 228.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,403 INFO L168 Benchmark]: TraceAbstraction took 307257.78 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,403 INFO L168 Benchmark]: Witness Printer took 31940.91 ms. Allocated memory is still 5.8 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:27,520 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.67 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 228.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307257.78 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 31940.91 ms. Allocated memory is still 5.8 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 307.2s OverallTime, 25 OverallIterations, 134 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 941 SDtfs, 1907 SDslu, 8030 SDs, 0 SdLazy, 10483 SolverSat, 2015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 29722 GetRequests, 28675 SyntacticMatches, 239 SemanticMatches, 808 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8138 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 235.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8752252252252253 AbsIntWeakeningRatio, 0.5783783783783784 AbsIntAvgWeakeningVarsNumRemoved, 0.1945945945945946 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 767 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 30380 NumberOfCodeBlocks, 25143 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 43493 ConstructedInterpolants, 0 QuantifiedInterpolants, 57484877 SizeOfPredicates, 134 NumberOfNonLiveVariables, 19845 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 58 InterpolantComputations, 2 PerfectInterpolantSequences, 1458712/1526286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...