./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:19:16,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:19:16,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:19:16,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:19:16,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:19:16,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:19:16,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:19:16,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:19:16,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:19:16,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:19:16,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:19:16,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:19:16,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:19:16,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:19:16,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:19:16,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:19:16,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:19:16,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:19:16,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:19:16,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:19:16,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:19:16,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:19:16,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:19:16,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:19:16,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:19:16,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:19:16,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:19:16,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:19:16,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:19:16,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:19:16,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:19:16,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:19:16,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:19:16,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:19:16,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:19:16,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:19:16,581 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 23:19:16,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:19:16,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:19:16,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:19:16,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:19:16,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:19:16,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:19:16,594 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:19:16,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:19:16,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:19:16,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:19:16,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:19:16,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:19:16,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:19:16,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:19:16,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:19:16,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:19:16,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:19:16,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:19:16,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:19:16,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:19:16,597 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:19:16,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:19:16,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:19:16,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_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2018-11-22 23:19:16,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:19:16,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:19:16,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:19:16,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:19:16,641 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:19:16,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-11-22 23:19:16,693 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/data/cd400f19f/85a1b5efdb064f6f9f77edeac95ce124/FLAGd60150799 [2018-11-22 23:19:17,034 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:19:17,035 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-11-22 23:19:17,040 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/data/cd400f19f/85a1b5efdb064f6f9f77edeac95ce124/FLAGd60150799 [2018-11-22 23:19:17,462 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/data/cd400f19f/85a1b5efdb064f6f9f77edeac95ce124 [2018-11-22 23:19:17,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:19:17,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:19:17,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:19:17,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:19:17,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:19:17,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17, skipping insertion in model container [2018-11-22 23:19:17,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:19:17,491 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:19:17,620 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:19:17,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:19:17,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:19:17,641 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:19:17,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17 WrapperNode [2018-11-22 23:19:17,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:19:17,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:19:17,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:19:17,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:19:17,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:19:17,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:19:17,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:19:17,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:19:17,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... [2018-11-22 23:19:17,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:19:17,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:19:17,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:19:17,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:19:17,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:19:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:19:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:19:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:19:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:19:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:19:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:19:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-22 23:19:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-22 23:19:17,849 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:19:17,850 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 23:19:17,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:17 BoogieIcfgContainer [2018-11-22 23:19:17,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:19:17,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:19:17,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:19:17,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:19:17,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:19:17" (1/3) ... [2018-11-22 23:19:17,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd98d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:19:17, skipping insertion in model container [2018-11-22 23:19:17,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:19:17" (2/3) ... [2018-11-22 23:19:17,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd98d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:19:17, skipping insertion in model container [2018-11-22 23:19:17,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:17" (3/3) ... [2018-11-22 23:19:17,855 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2018-11-22 23:19:17,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:19:17,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:19:17,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:19:17,897 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:19:17,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:19:17,897 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:19:17,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:19:17,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:19:17,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:19:17,898 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:19:17,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:19:17,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:19:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-22 23:19:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 23:19:17,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:17,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:17,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:17,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-22 23:19:17,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:17,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:17,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:17,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:19:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:19:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:19:18,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:19:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:19:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:19:18,044 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-22 23:19:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:18,133 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-22 23:19:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:19:18,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 23:19:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:18,140 INFO L225 Difference]: With dead ends: 35 [2018-11-22 23:19:18,140 INFO L226 Difference]: Without dead ends: 21 [2018-11-22 23:19:18,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:19:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-22 23:19:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-22 23:19:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:19:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-22 23:19:18,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-22 23:19:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 23:19:18,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:19:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-22 23:19:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 23:19:18,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:18,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:18,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-22 23:19:18,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:19:18,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:19:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:19:18,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:19:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:19:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:19:18,199 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-22 23:19:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:18,270 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-22 23:19:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:19:18,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-22 23:19:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:18,272 INFO L225 Difference]: With dead ends: 27 [2018-11-22 23:19:18,272 INFO L226 Difference]: Without dead ends: 23 [2018-11-22 23:19:18,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:19:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-22 23:19:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-22 23:19:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:19:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-22 23:19:18,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-22 23:19:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:18,278 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 23:19:18,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:19:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-22 23:19:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:19:18,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:18,280 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:18,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:18,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-22 23:19:18,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:18,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,346 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-22 23:19:18,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:18,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 23:19:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-22 23:19:18,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:19:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:19:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:19:18,444 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-22 23:19:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:18,535 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-22 23:19:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:19:18,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-22 23:19:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:18,537 INFO L225 Difference]: With dead ends: 38 [2018-11-22 23:19:18,538 INFO L226 Difference]: Without dead ends: 23 [2018-11-22 23:19:18,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:19:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-22 23:19:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-22 23:19:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:19:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-22 23:19:18,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-22 23:19:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:18,545 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-22 23:19:18,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:19:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-22 23:19:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:19:18,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:18,546 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:18,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:18,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:18,546 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-11-22 23:19:18,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,609 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-22 23:19:18,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:18,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:18,640 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-22 23:19:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 23:19:18,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:19:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:19:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:19:18,655 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-22 23:19:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:18,701 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-22 23:19:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:19:18,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-22 23:19:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:18,702 INFO L225 Difference]: With dead ends: 32 [2018-11-22 23:19:18,702 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 23:19:18,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:19:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 23:19:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-22 23:19:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 23:19:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-22 23:19:18,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-22 23:19:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:18,708 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-22 23:19:18,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:19:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-22 23:19:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 23:19:18,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:18,709 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:18,709 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:18,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-11-22 23:19:18,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:18,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:19:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:18,764 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-22 23:19:18,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:18,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:18,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:19:18,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:19:18,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:19:18,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-22 23:19:18,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-22 23:19:18,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:19:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:19:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:19:18,857 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-11-22 23:19:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:18,936 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-11-22 23:19:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:19:18,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-22 23:19:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:18,937 INFO L225 Difference]: With dead ends: 40 [2018-11-22 23:19:18,938 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 23:19:18,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:19:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 23:19:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-22 23:19:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 23:19:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-22 23:19:18,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-22 23:19:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:18,944 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-22 23:19:18,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:19:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-22 23:19:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-22 23:19:18,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:18,946 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:18,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:18,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-11-22 23:19:18,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:18,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:19:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-22 23:19:19,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:19,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:19:19,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-22 23:19:19,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:19:19,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-22 23:19:19,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:19,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-22 23:19:19,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 23:19:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 23:19:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:19:19,183 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-22 23:19:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:19,367 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-22 23:19:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:19:19,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-22 23:19:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:19,369 INFO L225 Difference]: With dead ends: 76 [2018-11-22 23:19:19,370 INFO L226 Difference]: Without dead ends: 49 [2018-11-22 23:19:19,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:19:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-22 23:19:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-22 23:19:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 23:19:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-22 23:19:19,377 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-22 23:19:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:19,377 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-22 23:19:19,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 23:19:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-22 23:19:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-22 23:19:19,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:19,379 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:19,379 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:19,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2018-11-22 23:19:19,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:19,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:19:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-22 23:19:19,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:19,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:19:19,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:19:19,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:19:19,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-22 23:19:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:19,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-22 23:19:19,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 23:19:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 23:19:19,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:19:19,593 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 19 states. [2018-11-22 23:19:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:20,070 INFO L93 Difference]: Finished difference Result 75 states and 150 transitions. [2018-11-22 23:19:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-22 23:19:20,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-11-22 23:19:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:20,073 INFO L225 Difference]: With dead ends: 75 [2018-11-22 23:19:20,073 INFO L226 Difference]: Without dead ends: 71 [2018-11-22 23:19:20,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-11-22 23:19:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-22 23:19:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-11-22 23:19:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-22 23:19:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-22 23:19:20,086 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 82 [2018-11-22 23:19:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:20,087 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-22 23:19:20,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 23:19:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-22 23:19:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-22 23:19:20,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:20,089 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:20,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:20,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1548772748, now seen corresponding path program 5 times [2018-11-22 23:19:20,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:20,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:20,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:19:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:19:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 294 proven. 145 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-11-22 23:19:20,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:19:20,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:19:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:19:20,240 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-22 23:19:20,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:19:20,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:19:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 822 proven. 67 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-22 23:19:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:19:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-22 23:19:20,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 23:19:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 23:19:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-22 23:19:20,335 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 16 states. [2018-11-22 23:19:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:19:20,689 INFO L93 Difference]: Finished difference Result 131 states and 277 transitions. [2018-11-22 23:19:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-22 23:19:20,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2018-11-22 23:19:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:19:20,691 INFO L225 Difference]: With dead ends: 131 [2018-11-22 23:19:20,691 INFO L226 Difference]: Without dead ends: 66 [2018-11-22 23:19:20,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2018-11-22 23:19:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-22 23:19:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-11-22 23:19:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-22 23:19:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-22 23:19:20,708 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 164 [2018-11-22 23:19:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:19:20,709 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-22 23:19:20,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 23:19:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-22 23:19:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-22 23:19:20,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:19:20,713 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:19:20,713 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:19:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:19:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 6 times [2018-11-22 23:19:20,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:19:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:19:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:20,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:19:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:19:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:19:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:19:20,755 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #33#return; [?] CALL call #t~ret3 := main(); [?] ~x~0 := 5; VAL [main_~x~0=5] [?] CALL call #t~ret2 := fibo(~x~0); VAL [|fibo_#in~n|=5] [?] ~n := #in~n; VAL [fibo_~n=5, |fibo_#in~n|=5] [?] assume !(~n < 1); VAL [fibo_~n=5, |fibo_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo_~n=5, |fibo_#in~n|=5] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=4] [?] ~n := #in~n; VAL [fibo_~n=4, |fibo_#in~n|=4] [?] assume !(~n < 1); VAL [fibo_~n=4, |fibo_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo_~n=4, |fibo_#in~n|=4] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=3] [?] ~n := #in~n; VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(~n < 1); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] assume true; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] RET #39#return; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#res|=3] [?] assume true; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#res|=3] [?] RET #39#return; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=3] [?] ~n := #in~n; VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(~n < 1); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] assume true; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] RET #41#return; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3, |fibo_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#res|=5] [?] assume true; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#res|=5] [?] RET #37#return; VAL [main_~x~0=5, |main_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~result~0=5, main_~x~0=5] [?] assume 5 == ~result~0; VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6-L12] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L8-L12] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6-L12] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L8-L12] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L5-L13] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L5-L13] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26-L28] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6-L12] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L8-L12] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6-L12] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L8-L12] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L5-L13] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L5-L13] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26-L28] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [L24] int x = 5; VAL [x=5] [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L25] int result = fibo(x); [L26] COND TRUE result == 5 VAL [result=5, x=5] [L27] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-22 23:19:20,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:19:20 BoogieIcfgContainer [2018-11-22 23:19:20,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:19:20,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:19:20,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:19:20,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:19:20,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:19:17" (3/4) ... [2018-11-22 23:19:20,851 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #33#return; [?] CALL call #t~ret3 := main(); [?] ~x~0 := 5; VAL [main_~x~0=5] [?] CALL call #t~ret2 := fibo(~x~0); VAL [|fibo_#in~n|=5] [?] ~n := #in~n; VAL [fibo_~n=5, |fibo_#in~n|=5] [?] assume !(~n < 1); VAL [fibo_~n=5, |fibo_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo_~n=5, |fibo_#in~n|=5] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=4] [?] ~n := #in~n; VAL [fibo_~n=4, |fibo_#in~n|=4] [?] assume !(~n < 1); VAL [fibo_~n=4, |fibo_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo_~n=4, |fibo_#in~n|=4] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=3] [?] ~n := #in~n; VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(~n < 1); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] assume true; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] RET #39#return; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#t~ret0|=2, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#res|=3] [?] assume true; VAL [fibo_~n=4, |fibo_#in~n|=4, |fibo_#res|=3] [?] RET #39#return; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=3] [?] ~n := #in~n; VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(~n < 1); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo_~n=3, |fibo_#in~n|=3] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=2] [?] ~n := #in~n; VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(~n < 1); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo_~n=2, |fibo_#in~n|=2] [?] CALL call #t~ret0 := fibo(~n - 1); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=0] [?] ~n := #in~n; VAL [fibo_~n=0, |fibo_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] assume true; VAL [fibo_~n=0, |fibo_#in~n|=0, |fibo_#res|=0] [?] RET #41#return; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#t~ret0|=1, |fibo_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=2, |fibo_#in~n|=2, |fibo_#res|=1] [?] RET #39#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1] [?] CALL call #t~ret1 := fibo(~n - 2); VAL [|fibo_#in~n|=1] [?] ~n := #in~n; VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume !(~n < 1); VAL [fibo_~n=1, |fibo_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] assume true; VAL [fibo_~n=1, |fibo_#in~n|=1, |fibo_#res|=1] [?] RET #41#return; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#t~ret0|=1, |fibo_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] assume true; VAL [fibo_~n=3, |fibo_#in~n|=3, |fibo_#res|=2] [?] RET #41#return; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#t~ret0|=3, |fibo_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#res|=5] [?] assume true; VAL [fibo_~n=5, |fibo_#in~n|=5, |fibo_#res|=5] [?] RET #37#return; VAL [main_~x~0=5, |main_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~result~0=5, main_~x~0=5] [?] assume 5 == ~result~0; VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6-L12] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L8-L12] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6-L12] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L8-L12] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L5-L13] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L5-L13] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26-L28] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6-L12] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L8-L12] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6-L12] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L8-L12] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L5-L13] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6-L12] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L8-L12] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6-L12] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L8-L12] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6-L12] assume ~n < 1; [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5-L13] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L5-L13] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6-L12] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L8-L12] assume 1 == ~n; [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5-L13] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L5-L13] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L5-L13] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26-L28] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L24] ~x~0 := 5; VAL [~x~0=5] [L25] CALL call #t~ret2 := fibo(~x~0); VAL [#in~n=5] [L5-L13] ~n := #in~n; VAL [#in~n=5, ~n=5] [L6] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L8] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=4] [L5-L13] ~n := #in~n; VAL [#in~n=4, ~n=4] [L6] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L8] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=3] [L5-L13] ~n := #in~n; VAL [#in~n=3, ~n=3] [L6] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L8] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L5-L13] ~n := #in~n; VAL [#in~n=2, ~n=2] [L6] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L8] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L11] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=0] [L5-L13] ~n := #in~n; VAL [#in~n=0, ~n=0] [L6] COND TRUE ~n < 1 [L7] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L11] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 2); VAL [#in~n=1] [L5-L13] ~n := #in~n; VAL [#in~n=1, ~n=1] [L6] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L8] COND TRUE 1 == ~n [L9] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L11] RET call #t~ret1 := fibo(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] #res := #t~ret0 + #t~ret1; [L11] havoc #t~ret0; [L11] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L25] RET call #t~ret2 := fibo(~x~0); VAL [#t~ret2=5, ~x~0=5] [L25] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L25] ~result~0 := #t~ret2; [L25] havoc #t~ret2; VAL [~result~0=5, ~x~0=5] [L26] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L27] assert false; VAL [~result~0=5, ~x~0=5] [L24] int x = 5; VAL [x=5] [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L25] int result = fibo(x); [L26] COND TRUE result == 5 VAL [result=5, x=5] [L27] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-22 23:19:21,137 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_39544a65-10c2-429e-8fd4-489ef2de1348/bin-2019/uautomizer/witness.graphml [2018-11-22 23:19:21,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:19:21,138 INFO L168 Benchmark]: Toolchain (without parser) took 3673.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 958.1 MB in the beginning and 902.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 296.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,140 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:19:21,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:19:21,140 INFO L168 Benchmark]: Boogie Preprocessor took 10.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,141 INFO L168 Benchmark]: RCFGBuilder took 185.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,141 INFO L168 Benchmark]: TraceAbstraction took 2993.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 47.2 MB). Free memory was 1.2 GB in the beginning and 911.5 MB in the end (delta: 268.6 MB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,141 INFO L168 Benchmark]: Witness Printer took 292.94 ms. Allocated memory is still 1.3 GB. Free memory was 911.5 MB in the beginning and 902.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:19:21,143 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.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 11.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 185.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2993.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 47.2 MB). Free memory was 1.2 GB in the beginning and 911.5 MB in the end (delta: 268.6 MB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. * Witness Printer took 292.94 ms. Allocated memory is still 1.3 GB. Free memory was 911.5 MB in the beginning and 902.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 5; VAL [x=5] [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L25] int result = fibo(x); [L26] COND TRUE result == 5 VAL [result=5, x=5] [L27] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 9 OverallIterations, 23 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 198 SDslu, 533 SDs, 0 SdLazy, 1044 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=8, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 140121 SizeOfPredicates, 24 NumberOfNonLiveVariables, 724 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 3893/4396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...