./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_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_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:36:17,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:36:17,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:36:17,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:36:17,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:36:17,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:36:17,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:36:17,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:36:17,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:36:17,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:36:17,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:36:17,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:36:17,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:36:17,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:36:17,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:36:17,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:36:17,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:36:17,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:36:17,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:36:17,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:36:17,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:36:17,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:36:17,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:36:17,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:36:17,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:36:17,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:36:17,466 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:36:17,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:36:17,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:36:17,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:36:17,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:36:17,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:36:17,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:36:17,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:36:17,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:36:17,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:36:17,470 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:36:17,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:36:17,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:36:17,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:36:17,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:36:17,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:36:17,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:36:17,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:36:17,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:36:17,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:36:17,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:36:17,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:36:17,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:36:17,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:36:17,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:36:17,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:36:17,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:36:17,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:36:17,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:36:17,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:36:17,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:36:17,486 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-23 01:36:17,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:36:17,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:36:17,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:36:17,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:36:17,521 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:36:17,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-23 01:36:17,554 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/data/f45ff3cb6/9324c2fd76a44732b35919c1cc4336c4/FLAGdec9b75a9 [2018-11-23 01:36:17,949 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:36:17,949 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-23 01:36:17,953 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/data/f45ff3cb6/9324c2fd76a44732b35919c1cc4336c4/FLAGdec9b75a9 [2018-11-23 01:36:17,961 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/data/f45ff3cb6/9324c2fd76a44732b35919c1cc4336c4 [2018-11-23 01:36:17,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:36:17,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:36:17,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:36:17,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:36:17,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:36:17,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:36:17" (1/1) ... [2018-11-23 01:36:17,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9989bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:17, skipping insertion in model container [2018-11-23 01:36:17,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:36:17" (1/1) ... [2018-11-23 01:36:17,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:36:17,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:36:18,091 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:36:18,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:36:18,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:36:18,112 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:36:18,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18 WrapperNode [2018-11-23 01:36:18,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:36:18,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:36:18,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:36:18,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:36:18,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:36:18,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:36:18,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:36:18,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:36:18,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... [2018-11-23 01:36:18,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:36:18,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:36:18,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:36:18,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:36:18,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:36:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:36:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:36:18,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:36:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:36:18,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:36:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:36:18,221 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-23 01:36:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-23 01:36:18,221 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-23 01:36:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-23 01:36:18,347 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:36:18,348 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 01:36:18,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:18 BoogieIcfgContainer [2018-11-23 01:36:18,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:36:18,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:36:18,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:36:18,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:36:18,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:36:17" (1/3) ... [2018-11-23 01:36:18,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:36:18, skipping insertion in model container [2018-11-23 01:36:18,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:18" (2/3) ... [2018-11-23 01:36:18,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:36:18, skipping insertion in model container [2018-11-23 01:36:18,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:18" (3/3) ... [2018-11-23 01:36:18,354 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-23 01:36:18,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:36:18,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:36:18,377 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:36:18,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:36:18,404 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:36:18,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:36:18,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:36:18,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:36:18,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:36:18,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:36:18,405 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:36:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 01:36:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:36:18,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:18,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:18,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:18,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-23 01:36:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:36:18,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:36:18,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:36:18,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:18,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:36:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:36:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:36:18,564 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-23 01:36:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:18,624 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 01:36:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:36:18,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 01:36:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:18,633 INFO L225 Difference]: With dead ends: 44 [2018-11-23 01:36:18,633 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 01:36:18,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:36:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 01:36:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 01:36:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 01:36:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 01:36:18,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-23 01:36:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:18,665 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 01:36:18,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:36:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 01:36:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 01:36:18,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:18,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:18,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:18,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-23 01:36:18,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:36:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:36:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:36:18,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:18,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:36:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:36:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:36:18,720 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-23 01:36:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:18,784 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 01:36:18,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:36:18,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 01:36:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:18,785 INFO L225 Difference]: With dead ends: 36 [2018-11-23 01:36:18,785 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:36:18,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:36:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:36:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 01:36:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 01:36:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 01:36:18,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-23 01:36:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:18,790 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 01:36:18,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:36:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 01:36:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:36:18,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:18,791 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:18,791 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:18,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-23 01:36:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:18,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:36:18,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:18,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:18,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-23 01:36:18,859 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-23 01:36:18,879 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:36:18,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:36:18,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:36:18,949 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-23 01:36:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:18,954 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:36:18,986 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 01:36:18,986 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:36:19,012 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-23 01:36:19,012 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:36:19,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:36:19,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 01:36:19,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:19,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:36:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:36:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:36:19,014 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-23 01:36:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:19,159 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-23 01:36:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:36:19,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 01:36:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:19,160 INFO L225 Difference]: With dead ends: 72 [2018-11-23 01:36:19,160 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 01:36:19,161 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:36:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 01:36:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 01:36:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 01:36:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-23 01:36:19,166 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-23 01:36:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-23 01:36:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:36:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 01:36:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 01:36:19,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:19,168 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:19,168 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:19,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-23 01:36:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:19,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:19,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 01:36:19,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:19,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:19,230 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 01:36:19,230 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 01:36:19,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:36:19,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:36:19,318 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:36:19,318 INFO L272 AbstractInterpreter]: Visited 28 different actions 200 times. Never merged. Widened at 2 different actions 11 times. Performed 411 root evaluator evaluations with a maximum evaluation depth of 4. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-23 01:36:19,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:19,324 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:36:19,337 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 01:36:19,337 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:36:19,360 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-23 01:36:19,360 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:36:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:36:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-23 01:36:19,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:19,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:36:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:36:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:36:19,362 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-23 01:36:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:19,591 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-23 01:36:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:36:19,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 01:36:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:19,592 INFO L225 Difference]: With dead ends: 87 [2018-11-23 01:36:19,592 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 01:36:19,593 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:36:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 01:36:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 01:36:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 01:36:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-23 01:36:19,600 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-23 01:36:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:19,601 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 01:36:19,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:36:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 01:36:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 01:36:19,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:19,603 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:19,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:19,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-23 01:36:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:19,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 01:36:19,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:19,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:19,673 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:36:19,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:36:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:19,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:19,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:36:19,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:36:19,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 01:36:19,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:36:19,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 01:36:19,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 01:36:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-23 01:36:20,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:20,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:36:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:36:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:36:20,018 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-23 01:36:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:20,168 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-23 01:36:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:36:20,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 01:36:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:20,174 INFO L225 Difference]: With dead ends: 121 [2018-11-23 01:36:20,174 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 01:36:20,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-23 01:36:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 01:36:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-23 01:36:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 01:36:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-23 01:36:20,188 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-23 01:36:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-23 01:36:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:36:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-23 01:36:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 01:36:20,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:20,190 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:20,190 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:20,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-23 01:36:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:20,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:36:20,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:20,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:36:20,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:20,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:20,246 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-23 01:36:20,246 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 01:36:20,247 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:36:20,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:36:21,154 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:36:21,154 INFO L272 AbstractInterpreter]: Visited 29 different actions 3929 times. Merged at 11 different actions 1050 times. Widened at 2 different actions 189 times. Performed 9241 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 481 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-23 01:36:21,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:21,180 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:36:21,196 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-11-23 01:36:21,196 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:36:21,264 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-23 01:36:21,264 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:36:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:36:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-23 01:36:21,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:21,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:36:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:36:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:36:21,265 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-11-23 01:36:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:21,581 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-11-23 01:36:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:36:21,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 01:36:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:21,583 INFO L225 Difference]: With dead ends: 118 [2018-11-23 01:36:21,583 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 01:36:21,583 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:36:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 01:36:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 01:36:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 01:36:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-23 01:36:21,593 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-11-23 01:36:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:21,593 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-23 01:36:21,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:36:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-23 01:36:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:36:21,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:21,596 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:21,596 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:21,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-11-23 01:36:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:21,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 01:36:21,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:21,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:21,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-23 01:36:21,659 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 01:36:21,660 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:36:21,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:36:21,968 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 01:36:21,969 INFO L272 AbstractInterpreter]: Visited 29 different actions 2572 times. Merged at 11 different actions 587 times. Widened at 2 different actions 135 times. Performed 5789 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5789 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 318 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-23 01:36:21,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:21,976 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 01:36:21,986 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 01:36:21,986 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 01:36:22,063 INFO L415 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-11-23 01:36:22,063 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 01:36:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:36:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-23 01:36:22,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:36:22,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:36:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:36:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:36:22,064 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-11-23 01:36:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:22,324 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-11-23 01:36:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:36:22,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-23 01:36:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:22,325 INFO L225 Difference]: With dead ends: 141 [2018-11-23 01:36:22,325 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 01:36:22,326 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:36:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 01:36:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 01:36:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 01:36:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-23 01:36:22,333 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-11-23 01:36:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:22,333 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-23 01:36:22,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:36:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-23 01:36:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 01:36:22,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:22,336 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:22,336 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:22,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-11-23 01:36:22,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:22,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:22,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 01:36:22,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:22,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:22,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-23 01:36:22,398 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-23 01:36:22,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:36:22,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:36:22,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:36:22,922 INFO L272 AbstractInterpreter]: Visited 34 different actions 4844 times. Merged at 14 different actions 1434 times. Widened at 2 different actions 189 times. Performed 11827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 11827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 615 fixpoints after 11 different actions. Largest state had 5 variables. [2018-11-23 01:36:22,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:22,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:36:22,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:22,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:22,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:22,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:36:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:23,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 01:36:23,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-23 01:36:23,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:23,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 17 [2018-11-23 01:36:23,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:23,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:36:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:36:23,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:36:23,602 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 12 states. [2018-11-23 01:36:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:23,783 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2018-11-23 01:36:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 01:36:23,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-23 01:36:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:23,785 INFO L225 Difference]: With dead ends: 212 [2018-11-23 01:36:23,785 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 01:36:23,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-11-23 01:36:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 01:36:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-11-23 01:36:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 01:36:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2018-11-23 01:36:23,801 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 94 [2018-11-23 01:36:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:23,801 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2018-11-23 01:36:23,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:36:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2018-11-23 01:36:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 01:36:23,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:23,803 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:23,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:23,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:23,803 INFO L82 PathProgramCache]: Analyzing trace with hash 721741772, now seen corresponding path program 2 times [2018-11-23 01:36:23,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:23,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 72 proven. 54 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-23 01:36:23,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:23,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:23,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:36:23,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:36:23,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:23,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:23,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:36:23,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:36:23,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 01:36:23,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:36:23,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-23 01:36:23,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 19 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-23 01:36:24,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:24,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 18 [2018-11-23 01:36:24,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:24,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 01:36:24,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 01:36:24,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:36:24,201 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 15 states. [2018-11-23 01:36:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:24,494 INFO L93 Difference]: Finished difference Result 231 states and 386 transitions. [2018-11-23 01:36:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 01:36:24,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2018-11-23 01:36:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:24,498 INFO L225 Difference]: With dead ends: 231 [2018-11-23 01:36:24,498 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 01:36:24,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-11-23 01:36:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 01:36:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2018-11-23 01:36:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 01:36:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2018-11-23 01:36:24,515 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 110 [2018-11-23 01:36:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:24,515 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2018-11-23 01:36:24,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 01:36:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2018-11-23 01:36:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-23 01:36:24,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:24,519 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:24,519 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:24,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1137267730, now seen corresponding path program 3 times [2018-11-23 01:36:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:24,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:36:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:24,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 112 proven. 83 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-11-23 01:36:24,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:24,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:24,643 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:36:24,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:36:24,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:24,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:36:24,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:36:24,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:36:24,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:36:24,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 97 proven. 129 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2018-11-23 01:36:24,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 97 proven. 133 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-11-23 01:36:25,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:25,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2018-11-23 01:36:25,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:25,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:36:25,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:36:25,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:36:25,210 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand 14 states. [2018-11-23 01:36:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:25,440 INFO L93 Difference]: Finished difference Result 320 states and 540 transitions. [2018-11-23 01:36:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 01:36:25,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-23 01:36:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:25,443 INFO L225 Difference]: With dead ends: 320 [2018-11-23 01:36:25,443 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 01:36:25,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 359 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-23 01:36:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 01:36:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 188. [2018-11-23 01:36:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 01:36:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 297 transitions. [2018-11-23 01:36:25,460 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 297 transitions. Word has length 188 [2018-11-23 01:36:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:25,461 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 297 transitions. [2018-11-23 01:36:25,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:36:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 297 transitions. [2018-11-23 01:36:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 01:36:25,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:25,464 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:25,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:25,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1552164849, now seen corresponding path program 4 times [2018-11-23 01:36:25,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:25,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:36:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:25,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 146 proven. 31 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2018-11-23 01:36:25,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:25,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:25,546 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:36:25,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:36:25,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:25,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:25,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:25,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:36:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:25,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 151 proven. 68 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2018-11-23 01:36:25,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 153 proven. 71 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2018-11-23 01:36:26,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:26,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 16 [2018-11-23 01:36:26,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:26,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:36:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:36:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-23 01:36:26,035 INFO L87 Difference]: Start difference. First operand 188 states and 297 transitions. Second operand 12 states. [2018-11-23 01:36:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:26,194 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2018-11-23 01:36:26,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:36:26,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2018-11-23 01:36:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:26,196 INFO L225 Difference]: With dead ends: 338 [2018-11-23 01:36:26,196 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 01:36:26,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 339 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-11-23 01:36:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 01:36:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2018-11-23 01:36:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 01:36:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2018-11-23 01:36:26,209 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 178 [2018-11-23 01:36:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:26,209 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2018-11-23 01:36:26,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:36:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2018-11-23 01:36:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-23 01:36:26,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:26,211 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:26,211 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:26,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -854759576, now seen corresponding path program 5 times [2018-11-23 01:36:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:26,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:26,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:36:26,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:26,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:36:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 267 proven. 35 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-23 01:36:26,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:26,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:36:26,316 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:36:26,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:36:26,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:36:26,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:36:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:36:26,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:36:26,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 01:36:26,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:36:26,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:36:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 306 proven. 36 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2018-11-23 01:36:26,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:36:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 306 proven. 38 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-23 01:36:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:36:26,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2018-11-23 01:36:26,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:36:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 01:36:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 01:36:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-23 01:36:26,896 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 15 states. [2018-11-23 01:36:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:36:27,126 INFO L93 Difference]: Finished difference Result 304 states and 462 transitions. [2018-11-23 01:36:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 01:36:27,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2018-11-23 01:36:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:36:27,128 INFO L225 Difference]: With dead ends: 304 [2018-11-23 01:36:27,128 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 01:36:27,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 365 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2018-11-23 01:36:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 01:36:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-11-23 01:36:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 01:36:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 240 transitions. [2018-11-23 01:36:27,139 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 240 transitions. Word has length 191 [2018-11-23 01:36:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:36:27,140 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 240 transitions. [2018-11-23 01:36:27,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 01:36:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2018-11-23 01:36:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-23 01:36:27,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:36:27,142 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:36:27,142 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:36:27,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:36:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 6 times [2018-11-23 01:36:27,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:36:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:27,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:36:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:36:27,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:36:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:36:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:36:27,174 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 6; VAL [main_~x~0=6] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #51#return; VAL [main_~x~0=6, |main_#t~ret4|=8] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=8, main_~x~0=6] [?] assume 8 == ~result~0; VAL [main_~result~0=8, main_~x~0=6] [?] assume !false; VAL [main_~result~0=8, main_~x~0=6] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] ----- [2018-11-23 01:36:27,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:36:27 BoogieIcfgContainer [2018-11-23 01:36:27,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:36:27,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:36:27,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:36:27,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:36:27,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:18" (3/4) ... [2018-11-23 01:36:27,408 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 6; VAL [main_~x~0=6] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #51#return; VAL [main_~x~0=6, |main_#t~ret4|=8] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=8, main_~x~0=6] [?] assume 8 == ~result~0; VAL [main_~result~0=8, main_~x~0=6] [?] assume !false; VAL [main_~result~0=8, main_~x~0=6] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] ----- [2018-11-23 01:36:28,046 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_df5df7ad-6d1e-4c6d-a3af-f59f482ac7da/bin-2019/utaipan/witness.graphml [2018-11-23 01:36:28,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:36:28,047 INFO L168 Benchmark]: Toolchain (without parser) took 10083.75 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 959.1 MB in the beginning and 895.3 MB in the end (delta: 63.8 MB). Peak memory consumption was 510.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,048 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-23 01:36:28,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,049 INFO L168 Benchmark]: Boogie Preprocessor took 11.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:36:28,049 INFO L168 Benchmark]: RCFGBuilder took 210.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,049 INFO L168 Benchmark]: TraceAbstraction took 9057.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 213.4 MB). Peak memory consumption was 520.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,049 INFO L168 Benchmark]: Witness Printer took 640.20 ms. Allocated memory is still 1.5 GB. Free memory was 906.6 MB in the beginning and 895.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:36:28,051 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 148.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 12.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9057.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 213.4 MB). Peak memory consumption was 520.6 MB. Max. memory is 11.5 GB. * Witness Printer took 640.20 ms. Allocated memory is still 1.5 GB. Free memory was 906.6 MB in the beginning and 895.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 8.9s OverallTime, 13 OverallIterations, 15 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 504 SDslu, 2642 SDs, 0 SdLazy, 1968 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1960 GetRequests, 1698 SyntacticMatches, 55 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8596938775510204 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.20408163265306123 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 148 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2030 NumberOfCodeBlocks, 1825 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2642 ConstructedInterpolants, 0 QuantifiedInterpolants, 566546 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 8710/9643 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...