./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-12-01 23:42:58,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 23:42:58,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 23:42:58,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 23:42:58,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 23:42:58,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 23:42:58,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 23:42:58,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 23:42:58,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 23:42:58,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 23:42:58,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 23:42:58,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 23:42:58,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 23:42:58,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 23:42:58,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 23:42:58,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 23:42:58,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 23:42:58,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 23:42:58,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 23:42:58,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 23:42:58,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 23:42:58,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 23:42:58,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 23:42:58,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 23:42:58,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 23:42:58,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 23:42:58,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 23:42:58,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 23:42:58,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 23:42:58,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 23:42:58,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 23:42:58,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 23:42:58,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 23:42:58,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 23:42:58,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 23:42:58,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 23:42:58,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 23:42:58,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 23:42:58,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 23:42:58,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 23:42:58,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 23:42:58,192 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 23:42:58,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 23:42:58,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 23:42:58,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 23:42:58,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 23:42:58,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 23:42:58,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 23:42:58,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 23:42:58,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 23:42:58,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 23:42:58,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 23:42:58,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 23:42:58,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 23:42:58,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 23:42:58,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 23:42:58,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 23:42:58,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 23:42:58,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 23:42:58,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 23:42:58,208 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 23:42:58,208 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 23:42:58,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 23:42:58,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 23:42:58,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 23:42:58,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 23:42:58,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 23:42:58,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 23:42:58,209 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 23:42:58,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 23:42:58,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 23:42:58,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak 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 -> Kojak 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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2019-12-01 23:42:58,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 23:42:58,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 23:42:58,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 23:42:58,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 23:42:58,326 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 23:42:58,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05.c [2019-12-01 23:42:58,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/data/5788e7f56/eb2a1a1351e84940965d67dd6155399b/FLAG74ad94aa3 [2019-12-01 23:42:58,764 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 23:42:58,765 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/sv-benchmarks/c/recursive/Fibonacci05.c [2019-12-01 23:42:58,769 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/data/5788e7f56/eb2a1a1351e84940965d67dd6155399b/FLAG74ad94aa3 [2019-12-01 23:42:58,777 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/data/5788e7f56/eb2a1a1351e84940965d67dd6155399b [2019-12-01 23:42:58,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 23:42:58,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 23:42:58,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 23:42:58,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 23:42:58,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 23:42:58,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58, skipping insertion in model container [2019-12-01 23:42:58,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 23:42:58,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 23:42:58,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 23:42:58,905 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 23:42:58,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 23:42:58,964 INFO L208 MainTranslator]: Completed translation [2019-12-01 23:42:58,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58 WrapperNode [2019-12-01 23:42:58,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 23:42:58,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 23:42:58,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 23:42:58,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 23:42:58,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 23:42:58,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 23:42:58,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 23:42:58,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 23:42:58,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... [2019-12-01 23:42:58,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 23:42:58,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 23:42:58,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 23:42:58,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 23:42:58,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:42:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-01 23:42:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-12-01 23:42:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-12-01 23:42:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 23:42:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 23:42:59,134 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 23:42:59,134 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-01 23:42:59,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:42:59 BoogieIcfgContainer [2019-12-01 23:42:59,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 23:42:59,135 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 23:42:59,135 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 23:42:59,142 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 23:42:59,143 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:42:59" (1/1) ... [2019-12-01 23:42:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 23:42:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2019-12-01 23:42:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-01 23:42:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-01 23:42:59,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:42:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2019-12-01 23:42:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-12-01 23:42:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-01 23:42:59,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:42:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2019-12-01 23:42:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-12-01 23:42:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 23:42:59,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 23:42:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 28 states and 42 transitions. [2019-12-01 23:42:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2019-12-01 23:42:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 23:42:59,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 23:42:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 35 states and 59 transitions. [2019-12-01 23:42:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2019-12-01 23:42:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 23:42:59,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 23:42:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:42:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 35 states and 58 transitions. [2019-12-01 23:42:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2019-12-01 23:42:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 23:42:59,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:42:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:42:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-01 23:43:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 42 states and 76 transitions. [2019-12-01 23:43:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 76 transitions. [2019-12-01 23:43:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-01 23:43:00,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-12-01 23:43:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 49 states and 96 transitions. [2019-12-01 23:43:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 96 transitions. [2019-12-01 23:43:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 23:43:00,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 395 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-12-01 23:43:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 51 states and 98 transitions. [2019-12-01 23:43:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 98 transitions. [2019-12-01 23:43:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-01 23:43:01,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-01 23:43:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 56 states and 116 transitions. [2019-12-01 23:43:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 116 transitions. [2019-12-01 23:43:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-01 23:43:01,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 686 proven. 911 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-12-01 23:43:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 58 states and 118 transitions. [2019-12-01 23:43:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-01 23:43:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:43:02,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 427 proven. 914 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-12-01 23:43:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 60 states and 120 transitions. [2019-12-01 23:43:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 120 transitions. [2019-12-01 23:43:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 23:43:02,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-12-01 23:43:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 65 states and 139 transitions. [2019-12-01 23:43:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 139 transitions. [2019-12-01 23:43:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-12-01 23:43:03,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-12-01 23:43:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 72 states and 163 transitions. [2019-12-01 23:43:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 163 transitions. [2019-12-01 23:43:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-01 23:43:03,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2443 proven. 4854 refuted. 0 times theorem prover too weak. 9110 trivial. 0 not checked. [2019-12-01 23:43:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 74 states and 165 transitions. [2019-12-01 23:43:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 165 transitions. [2019-12-01 23:43:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-12-01 23:43:04,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 6061 proven. 4292 refuted. 0 times theorem prover too weak. 8750 trivial. 0 not checked. [2019-12-01 23:43:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 76 states and 167 transitions. [2019-12-01 23:43:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 167 transitions. [2019-12-01 23:43:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-12-01 23:43:05,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 8529 proven. 9074 refuted. 0 times theorem prover too weak. 11912 trivial. 0 not checked. [2019-12-01 23:43:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 76 states and 167 transitions. [2019-12-01 23:43:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 167 transitions. [2019-12-01 23:43:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-12-01 23:43:07,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:43:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 6061 proven. 4292 refuted. 0 times theorem prover too weak. 8750 trivial. 0 not checked. [2019-12-01 23:43:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:43:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 76 states and 167 transitions. [2019-12-01 23:43:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 167 transitions. [2019-12-01 23:43:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-12-01 23:43:07,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:43:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:43:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:43:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:43:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:43:08,181 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 18 iterations. [2019-12-01 23:43:08,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 11:43:08 ImpRootNode [2019-12-01 23:43:08,270 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 23:43:08,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 23:43:08,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 23:43:08,271 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 23:43:08,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:42:59" (3/4) ... [2019-12-01 23:43:08,273 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 23:43:08,371 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a1f9fcb1-9f88-4b22-8a88-8fef42eae544/bin/ukojak/witness.graphml [2019-12-01 23:43:08,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 23:43:08,372 INFO L168 Benchmark]: Toolchain (without parser) took 9591.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. [2019-12-01 23:43:08,372 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 23:43:08,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-01 23:43:08,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 23:43:08,373 INFO L168 Benchmark]: Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 23:43:08,373 INFO L168 Benchmark]: RCFGBuilder took 138.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-01 23:43:08,373 INFO L168 Benchmark]: CodeCheck took 9135.14 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. [2019-12-01 23:43:08,374 INFO L168 Benchmark]: Witness Printer took 99.94 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-12-01 23:43:08,375 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.0s, OverallIterations: 18, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 981872 SDtfs, 1087920 SDslu, 1749856 SDs, 0 SdLazy, 4818616 SolverSat, 1166264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13941 GetRequests, 12718 SyntacticMatches, 1071 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26255 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 4134 NumberOfCodeBlocks, 4134 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3658 ConstructedInterpolants, 0 QuantifiedInterpolants, 3905130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 70252/97008 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * CodeCheck took 9135.14 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. * Witness Printer took 99.94 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...