./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/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_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/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-5842f4b [2018-11-18 17:41:09,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:41:09,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:41:09,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:41:09,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:41:09,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:41:09,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:41:09,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:41:09,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:41:09,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:41:09,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:41:09,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:41:09,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:41:09,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:41:09,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:41:09,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:41:09,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:41:09,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:41:09,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:41:09,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:41:09,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:41:09,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:41:09,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:41:09,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:41:09,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:41:09,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:41:09,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:41:09,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:41:09,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:41:09,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:41:09,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:41:09,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:41:09,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:41:09,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:41:09,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:41:09,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:41:09,913 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 17:41:09,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:41:09,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:41:09,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:41:09,924 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:41:09,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:41:09,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:41:09,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:41:09,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:41:09,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:41:09,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:41:09,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:41:09,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:41:09,926 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 17:41:09,927 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 17:41:09,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:41:09,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 17:41:09,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:41:09,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:41:09,930 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_61850085-6039-4e32-b7dc-c2bb53879df9/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-11-18 17:41:09,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:41:09,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:41:09,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:41:09,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:41:09,968 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:41:09,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 17:41:10,014 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/data/681c5dffd/02b8376e444345f4badc4cad0bb25b0c/FLAGb74c03e13 [2018-11-18 17:41:10,414 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:41:10,415 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 17:41:10,419 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/data/681c5dffd/02b8376e444345f4badc4cad0bb25b0c/FLAGb74c03e13 [2018-11-18 17:41:10,430 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/data/681c5dffd/02b8376e444345f4badc4cad0bb25b0c [2018-11-18 17:41:10,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:41:10,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:41:10,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:41:10,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:41:10,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:41:10,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788382f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10, skipping insertion in model container [2018-11-18 17:41:10,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:41:10,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:41:10,561 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:41:10,563 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:41:10,573 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:41:10,582 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:41:10,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10 WrapperNode [2018-11-18 17:41:10,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:41:10,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:41:10,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:41:10,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:41:10,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:41:10,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:41:10,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:41:10,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:41:10,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:41:10,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:41:10,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:41:10,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:41:10,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:41:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/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-11-18 17:41:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-18 17:41:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-18 17:41:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:41:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:41:10,790 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:41:10,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:41:10 BoogieIcfgContainer [2018-11-18 17:41:10,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:41:10,791 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 17:41:10,791 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 17:41:10,798 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 17:41:10,799 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:41:10" (1/1) ... [2018-11-18 17:41:10,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:41:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-11-18 17:41:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-18 17:41:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 17:41:10,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:41:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-18 17:41:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-18 17:41:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 17:41:11,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:41:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2018-11-18 17:41:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-11-18 17:41:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:41:11,232 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 17:41:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2018-11-18 17:41:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-11-18 17:41:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:41:11,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 17:41:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2018-11-18 17:41:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2018-11-18 17:41:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:41:11,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 17:41:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 48 transitions. [2018-11-18 17:41:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2018-11-18 17:41:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:41:11,781 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:41:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 37 states and 60 transitions. [2018-11-18 17:41:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2018-11-18 17:41:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 17:41:11,979 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 17:41:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 39 states and 64 transitions. [2018-11-18 17:41:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2018-11-18 17:41:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 17:41:12,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-18 17:41:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 82 transitions. [2018-11-18 17:41:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions. [2018-11-18 17:41:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 17:41:12,484 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-11-18 17:41:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 53 states and 102 transitions. [2018-11-18 17:41:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 102 transitions. [2018-11-18 17:41:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-18 17:41:12,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 261 proven. 684 refuted. 0 times theorem prover too weak. 2385 trivial. 0 not checked. [2018-11-18 17:41:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 55 states and 104 transitions. [2018-11-18 17:41:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 104 transitions. [2018-11-18 17:41:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-18 17:41:13,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 403 proven. 124 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-18 17:41:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 60 states and 122 transitions. [2018-11-18 17:41:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2018-11-18 17:41:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 17:41:13,971 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-11-18 17:41:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 62 states and 126 transitions. [2018-11-18 17:41:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2018-11-18 17:41:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-18 17:41:14,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 299 proven. 1577 refuted. 0 times theorem prover too weak. 9071 trivial. 0 not checked. [2018-11-18 17:41:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 69 states and 150 transitions. [2018-11-18 17:41:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 150 transitions. [2018-11-18 17:41:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-11-18 17:41:14,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:41:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 935 proven. 3838 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2018-11-18 17:41:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:41:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions. [2018-11-18 17:41:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions. [2018-11-18 17:41:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-18 17:41:15,333 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:41:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:41:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:41:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:41:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:41:15,609 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 15 iterations. [2018-11-18 17:41:15,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 05:41:15 ImpRootNode [2018-11-18 17:41:15,664 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 17:41:15,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:41:15,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:41:15,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:41:15,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:41:10" (3/4) ... [2018-11-18 17:41:15,667 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:41:15,734 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_61850085-6039-4e32-b7dc-c2bb53879df9/bin-2019/ukojak/witness.graphml [2018-11-18 17:41:15,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:41:15,735 INFO L168 Benchmark]: Toolchain (without parser) took 5302.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,736 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:41:15,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,737 INFO L168 Benchmark]: Boogie Preprocessor took 9.64 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:41:15,737 INFO L168 Benchmark]: RCFGBuilder took 179.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,737 INFO L168 Benchmark]: CodeCheck took 4872.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.4 MB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,738 INFO L168 Benchmark]: Witness Printer took 70.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:41:15,739 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, 19 locations, 1 error locations. UNSAFE Result, 4.7s OverallTime, 15 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117724 SDtfs, 122068 SDslu, 194984 SDs, 0 SdLazy, 525238 SolverSat, 142806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7780 GetRequests, 7389 SyntacticMatches, 265 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7197 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2622 NumberOfCodeBlocks, 2622 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2149 ConstructedInterpolants, 0 QuantifiedInterpolants, 989307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 38878/46135 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.64 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 179.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 4872.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.4 MB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...