./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 635dfa2a
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/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.23-635dfa2
[2018-12-02 20:22:26,554 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-12-02 20:22:26,555 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-02 20:22:26,563 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-02 20:22:26,563 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-02 20:22:26,563 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-02 20:22:26,564 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-02 20:22:26,565 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-02 20:22:26,566 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-02 20:22:26,567 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-02 20:22:26,567 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-02 20:22:26,567 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-02 20:22:26,568 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-02 20:22:26,568 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-02 20:22:26,569 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-02 20:22:26,570 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-02 20:22:26,570 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-02 20:22:26,571 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-02 20:22:26,573 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-02 20:22:26,574 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-02 20:22:26,574 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-02 20:22:26,575 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-02 20:22:26,577 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-02 20:22:26,577 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-02 20:22:26,577 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-02 20:22:26,578 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-02 20:22:26,578 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-02 20:22:26,579 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-02 20:22:26,579 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-02 20:22:26,580 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-02 20:22:26,580 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-02 20:22:26,581 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-02 20:22:26,581 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-02 20:22:26,581 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-02 20:22:26,582 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-02 20:22:26,582 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-12-02 20:22:26,582 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf
[2018-12-02 20:22:26,592 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-12-02 20:22:26,592 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-02 20:22:26,593 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-02 20:22:26,593 INFO  L133        SettingsManager]:  * ... to procedures called more than once=ALWAYS
[2018-12-02 20:22:26,594 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-12-02 20:22:26,594 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-12-02 20:22:26,594 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-12-02 20:22:26,595 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-12-02 20:22:26,595 INFO  L131        SettingsManager]: Preferences of CodeCheck differ from their defaults:
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Timeout in seconds=1000000
[2018-12-02 20:22:26,596 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000
[2018-12-02 20:22:26,596 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Trace refinement strategy=PENGUIN
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-02 20:22:26,596 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-12-02 20:22:26,597 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
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_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/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
[2018-12-02 20:22:26,618 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-02 20:22:26,624 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-02 20:22:26,626 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-02 20:22:26,627 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-12-02 20:22:26,627 INFO  L276        PluginConnector]: CDTParser initialized
[2018-12-02 20:22:26,628 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c
[2018-12-02 20:22:26,662 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/data/930a284a6/b06c08e4fe34482d8968f40b1c262aa1/FLAG48b1035d6
[2018-12-02 20:22:27,033 INFO  L307              CDTParser]: Found 1 translation units.
[2018-12-02 20:22:27,034 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c
[2018-12-02 20:22:27,037 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/data/930a284a6/b06c08e4fe34482d8968f40b1c262aa1/FLAG48b1035d6
[2018-12-02 20:22:27,045 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/data/930a284a6/b06c08e4fe34482d8968f40b1c262aa1
[2018-12-02 20:22:27,047 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-02 20:22:27,048 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-12-02 20:22:27,048 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-12-02 20:22:27,048 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-12-02 20:22:27,051 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-12-02 20:22:27,052 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,053 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56acabfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27, skipping insertion in model container
[2018-12-02 20:22:27,054 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,058 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-12-02 20:22:27,068 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-12-02 20:22:27,149 INFO  L203          PostProcessor]: Analyzing one entry point: main
[2018-12-02 20:22:27,151 INFO  L191         MainTranslator]: Completed pre-run
[2018-12-02 20:22:27,160 INFO  L203          PostProcessor]: Analyzing one entry point: main
[2018-12-02 20:22:27,168 INFO  L195         MainTranslator]: Completed translation
[2018-12-02 20:22:27,168 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27 WrapperNode
[2018-12-02 20:22:27,168 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-12-02 20:22:27,169 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-02 20:22:27,169 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-02 20:22:27,169 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-02 20:22:27,175 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,178 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,188 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-02 20:22:27,188 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-02 20:22:27,188 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-02 20:22:27,188 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-12-02 20:22:27,193 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,194 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,194 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,194 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,195 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,196 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,197 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,204 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-02 20:22:27,205 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-02 20:22:27,205 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-12-02 20:22:27,205 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-12-02 20:22:27,206 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/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
[2018-12-02 20:22:27,263 INFO  L130     BoogieDeclarations]: Found specification of procedure fibonacci
[2018-12-02 20:22:27,263 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibonacci
[2018-12-02 20:22:27,263 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-02 20:22:27,263 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-02 20:22:27,354 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-02 20:22:27,354 INFO  L280             CfgBuilder]: Removed 4 assue(true) statements.
[2018-12-02 20:22:27,354 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:22:27 BoogieIcfgContainer
[2018-12-02 20:22:27,355 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-02 20:22:27,355 INFO  L113        PluginConnector]: ------------------------CodeCheck----------------------------
[2018-12-02 20:22:27,355 INFO  L271        PluginConnector]: Initializing CodeCheck...
[2018-12-02 20:22:27,363 INFO  L276        PluginConnector]: CodeCheck initialized
[2018-12-02 20:22:27,363 INFO  L185        PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:22:27" (1/1) ...
[2018-12-02 20:22:27,373 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-12-02 20:22:27,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:27,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions.
[2018-12-02 20:22:27,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions.
[2018-12-02 20:22:27,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-12-02 20:22:27,411 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:27,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:27,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-02 20:22:27,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:27,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions.
[2018-12-02 20:22:27,568 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions.
[2018-12-02 20:22:27,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-12-02 20:22:27,568 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:27,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:27,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-02 20:22:27,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:27,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions.
[2018-12-02 20:22:27,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions.
[2018-12-02 20:22:27,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-12-02 20:22:27,677 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:27,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:27,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-02 20:22:27,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:27,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions.
[2018-12-02 20:22:27,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions.
[2018-12-02 20:22:27,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-12-02 20:22:27,813 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:27,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:27,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-02 20:22:28,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions.
[2018-12-02 20:22:28,065 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions.
[2018-12-02 20:22:28,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-12-02 20:22:28,067 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-12-02 20:22:28,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 48 transitions.
[2018-12-02 20:22:28,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions.
[2018-12-02 20:22:28,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-12-02 20:22:28,174 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-12-02 20:22:28,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 37 states and 60 transitions.
[2018-12-02 20:22:28,365 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions.
[2018-12-02 20:22:28,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-12-02 20:22:28,366 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2018-12-02 20:22:28,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 39 states and 64 transitions.
[2018-12-02 20:22:28,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions.
[2018-12-02 20:22:28,497 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-12-02 20:22:28,497 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2018-12-02 20:22:28,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 44 states and 78 transitions.
[2018-12-02 20:22:28,702 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions.
[2018-12-02 20:22:28,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-12-02 20:22:28,704 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked.
[2018-12-02 20:22:28,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:28,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 82 transitions.
[2018-12-02 20:22:28,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions.
[2018-12-02 20:22:28,843 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2018-12-02 20:22:28,843 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:28,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:28,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked.
[2018-12-02 20:22:29,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:29,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 51 states and 98 transitions.
[2018-12-02 20:22:29,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 98 transitions.
[2018-12-02 20:22:29,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2018-12-02 20:22:29,102 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:29,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:29,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked.
[2018-12-02 20:22:29,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:29,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 53 states and 102 transitions.
[2018-12-02 20:22:29,285 INFO  L276                IsEmpty]: Start isEmpty. Operand 53 states and 102 transitions.
[2018-12-02 20:22:29,288 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2018-12-02 20:22:29,288 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:29,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:29,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 3330 backedges. 282 proven. 663 refuted. 0 times theorem prover too weak. 2385 trivial. 0 not checked.
[2018-12-02 20:22:30,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:30,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 55 states and 104 transitions.
[2018-12-02 20:22:30,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 104 transitions.
[2018-12-02 20:22:30,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2018-12-02 20:22:30,027 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:30,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:30,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked.
[2018-12-02 20:22:30,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:30,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 62 states and 126 transitions.
[2018-12-02 20:22:30,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions.
[2018-12-02 20:22:30,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 283
[2018-12-02 20:22:30,441 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:30,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:30,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 4568 backedges. 702 proven. 270 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked.
[2018-12-02 20:22:30,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:30,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 67 states and 146 transitions.
[2018-12-02 20:22:30,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 146 transitions.
[2018-12-02 20:22:30,795 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 433
[2018-12-02 20:22:30,795 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:30,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:30,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 10947 backedges. 299 proven. 1577 refuted. 0 times theorem prover too weak. 9071 trivial. 0 not checked.
[2018-12-02 20:22:31,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:31,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 69 states and 150 transitions.
[2018-12-02 20:22:31,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 150 transitions.
[2018-12-02 20:22:31,021 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 651
[2018-12-02 20:22:31,021 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:31,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:31,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 25110 backedges. 991 proven. 3782 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked.
[2018-12-02 20:22:31,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:31,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions.
[2018-12-02 20:22:31,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions.
[2018-12-02 20:22:31,597 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 651
[2018-12-02 20:22:31,597 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:31,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:31,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 25110 backedges. 935 proven. 3838 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked.
[2018-12-02 20:22:31,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:31,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions.
[2018-12-02 20:22:31,929 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions.
[2018-12-02 20:22:31,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 651
[2018-12-02 20:22:31,932 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:31,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:32,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 25110 backedges. 935 proven. 3838 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked.
[2018-12-02 20:22:32,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:32,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions.
[2018-12-02 20:22:32,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions.
[2018-12-02 20:22:32,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 705
[2018-12-02 20:22:32,301 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:32,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:32,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked.
[2018-12-02 20:22:32,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:32,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 73 states and 154 transitions.
[2018-12-02 20:22:32,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 154 transitions.
[2018-12-02 20:22:32,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 637
[2018-12-02 20:22:32,906 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:32,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-02 20:22:33,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 24027 backedges. 3672 proven. 1546 refuted. 0 times theorem prover too weak. 18809 trivial. 0 not checked.
[2018-12-02 20:22:33,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-02 20:22:33,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 75 states and 156 transitions.
[2018-12-02 20:22:33,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 156 transitions.
[2018-12-02 20:22:33,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2018-12-02 20:22:33,333 INFO  L431      CodeCheckObserver]: Error Path is FOUND.
[2018-12-02 20:22:33,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-02 20:22:33,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-02 20:22:33,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-02 20:22:33,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-02 20:22:33,552 WARN  L497      CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations.
[2018-12-02 20:22:33,624 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 08:22:33 ImpRootNode
[2018-12-02 20:22:33,624 INFO  L132        PluginConnector]: ------------------------ END CodeCheck----------------------------
[2018-12-02 20:22:33,624 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-12-02 20:22:33,624 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-12-02 20:22:33,625 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-12-02 20:22:33,625 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:22:27" (3/4) ...
[2018-12-02 20:22:33,627 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-12-02 20:22:33,706 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_39c864d7-3f4a-4f17-b0a4-5539fcbf0356/bin-2019/ukojak/witness.graphml
[2018-12-02 20:22:33,706 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-12-02 20:22:33,706 INFO  L168              Benchmark]: Toolchain (without parser) took 6659.30 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 803.7 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -369.9 MB). Peak memory consumption was 433.8 MB. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,707 INFO  L168              Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,707 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 120.44 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,708 INFO  L168              Benchmark]: Boogie Procedure Inliner took 19.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,708 INFO  L168              Benchmark]: Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 993.2 MB in the end (delta: -47.9 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,708 INFO  L168              Benchmark]: RCFGBuilder took 149.85 ms. Allocated memory is still 1.0 GB. Free memory was 987.8 MB in the beginning and 993.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,708 INFO  L168              Benchmark]: CodeCheck took 6269.26 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 803.7 MB). Free memory was 993.6 MB in the beginning and 1.3 GB in the end (delta: -332.3 MB). Peak memory consumption was 471.4 MB. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,708 INFO  L168              Benchmark]: Witness Printer took 81.40 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-02 20:22:33,709 INFO  L336   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, 18 locations, 1 error locations. UNSAFE Result, 6.1s OverallTime, 21 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7515852 SDtfs, 7776204 SDslu, 12406680 SDs, 0 SdLazy, 33389258 SolverSat, 9067978 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15493 GetRequests, 14792 SyntacticMatches, 565 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11662 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5527 NumberOfCodeBlocks, 5527 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5048 ConstructedInterpolants, 0 QuantifiedInterpolants, 3238608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 131910/153160 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 120.44 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
 * Boogie Procedure Inliner took 19.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 993.2 MB in the end (delta: -47.9 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 149.85 ms. Allocated memory is still 1.0 GB. Free memory was 987.8 MB in the beginning and 993.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB.
 * CodeCheck took 6269.26 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 803.7 MB). Free memory was 993.6 MB in the beginning and 1.3 GB in the end (delta: -332.3 MB). Peak memory consumption was 471.4 MB. Max. memory is 11.5 GB.
 * Witness Printer took 81.40 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB.
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...