./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:49:45,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:49:45,220 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:49:45,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:49:45,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:49:45,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:49:45,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:49:45,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:49:45,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:49:45,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:49:45,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:49:45,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:49:45,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:49:45,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:49:45,235 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:49:45,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:49:45,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:49:45,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:49:45,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:49:45,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:49:45,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:49:45,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:49:45,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:49:45,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:49:45,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:49:45,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:49:45,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:49:45,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:49:45,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:49:45,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:49:45,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:49:45,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:49:45,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:49:45,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:49:45,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:49:45,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:49:45,247 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:49:45,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:49:45,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:49:45,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:49:45,258 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:49:45,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:49:45,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:49:45,258 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:49:45,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:49:45,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:49:45,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:49:45,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:49:45,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:49:45,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2018-11-23 15:49:45,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:49:45,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:49:45,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:49:45,300 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:49:45,300 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:49:45,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-23 15:49:45,346 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/data/d1eac87f3/1fe2b65d64fc4dccb6009cbce39fa2af/FLAG8c469a6be [2018-11-23 15:49:45,676 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:49:45,677 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-23 15:49:45,681 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/data/d1eac87f3/1fe2b65d64fc4dccb6009cbce39fa2af/FLAG8c469a6be [2018-11-23 15:49:46,105 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/data/d1eac87f3/1fe2b65d64fc4dccb6009cbce39fa2af [2018-11-23 15:49:46,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:49:46,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:49:46,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:49:46,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:49:46,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:49:46,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12858536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46, skipping insertion in model container [2018-11-23 15:49:46,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:49:46,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:49:46,239 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:49:46,241 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:49:46,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:49:46,259 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:49:46,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46 WrapperNode [2018-11-23 15:49:46,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:49:46,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:49:46,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:49:46,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:49:46,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:49:46,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:49:46,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:49:46,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:49:46,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... [2018-11-23 15:49:46,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:49:46,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:49:46,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:49:46,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:49:46,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:49:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:49:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:49:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:49:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:49:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:49:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:49:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-23 15:49:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-23 15:49:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-23 15:49:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-23 15:49:46,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:49:46,450 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 15:49:46,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:46 BoogieIcfgContainer [2018-11-23 15:49:46,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:49:46,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:49:46,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:49:46,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:49:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:49:46" (1/3) ... [2018-11-23 15:49:46,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a033c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:46, skipping insertion in model container [2018-11-23 15:49:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:46" (2/3) ... [2018-11-23 15:49:46,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a033c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:46, skipping insertion in model container [2018-11-23 15:49:46,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:46" (3/3) ... [2018-11-23 15:49:46,456 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-23 15:49:46,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:49:46,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:49:46,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:49:46,496 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:49:46,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:49:46,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:49:46,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:49:46,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:49:46,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:49:46,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:49:46,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:49:46,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:49:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 15:49:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:49:46,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:46,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:46,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:46,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-23 15:49:46,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:46,651 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 15:49:46,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:49:46,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:49:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:49:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:49:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:49:46,670 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-23 15:49:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:46,741 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 15:49:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:49:46,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 15:49:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:46,750 INFO L225 Difference]: With dead ends: 44 [2018-11-23 15:49:46,750 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 15:49:46,753 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 15:49:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 15:49:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:49:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:49:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 15:49:46,782 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-23 15:49:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 15:49:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:49:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 15:49:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 15:49:46,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:46,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:46,784 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:46,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-23 15:49:46,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:46,819 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 15:49:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:49:46,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:49:46,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:49:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:49:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:49:46,821 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-23 15:49:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:46,890 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 15:49:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:49:46,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 15:49:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:46,892 INFO L225 Difference]: With dead ends: 36 [2018-11-23 15:49:46,892 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 15:49:46,892 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 15:49:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 15:49:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 15:49:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:49:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 15:49:46,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-23 15:49:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:46,897 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 15:49:46,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:49:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 15:49:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:49:46,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:46,898 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 15:49:46,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:46,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-23 15:49:46,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:46,977 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 15:49:46,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:46,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:46,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:47,058 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 15:49:47,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-23 15:49:47,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:49:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:49:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:49:47,076 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-23 15:49:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:47,214 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-23 15:49:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:49:47,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 15:49:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:47,216 INFO L225 Difference]: With dead ends: 58 [2018-11-23 15:49:47,216 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:49:47,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:49:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:49:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 15:49:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:49:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 15:49:47,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-23 15:49:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:47,222 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:49:47,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:49:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 15:49:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:49:47,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:47,223 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 15:49:47,224 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:47,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-23 15:49:47,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:47,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,277 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 15:49:47,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:47,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:47,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:47,301 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 15:49:47,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:47,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 15:49:47,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:49:47,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:49:47,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:49:47,316 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-23 15:49:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:47,385 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 15:49:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:49:47,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 15:49:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:47,387 INFO L225 Difference]: With dead ends: 43 [2018-11-23 15:49:47,387 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:49:47,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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 15:49:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:49:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 15:49:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:49:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-23 15:49:47,396 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-23 15:49:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:47,396 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-23 15:49:47,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:49:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-23 15:49:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:49:47,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:47,398 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 15:49:47,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:47,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-23 15:49:47,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:47,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,461 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 15:49:47,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:47,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 15:49:47,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:47,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-23 15:49:47,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:49:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:49:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:49:47,544 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-23 15:49:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:47,691 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-23 15:49:47,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:49:47,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-23 15:49:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:47,692 INFO L225 Difference]: With dead ends: 70 [2018-11-23 15:49:47,693 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:49:47,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:49:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:49:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:49:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:49:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-23 15:49:47,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-23 15:49:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:47,702 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-23 15:49:47,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:49:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-23 15:49:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 15:49:47,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:47,703 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, 1] [2018-11-23 15:49:47,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:47,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-23 15:49:47,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:47,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:47,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 15:49:47,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:47,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 15:49:47,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:47,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-23 15:49:47,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:49:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:49:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:49:47,821 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-23 15:49:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:47,925 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-23 15:49:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:49:47,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-23 15:49:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:47,926 INFO L225 Difference]: With dead ends: 61 [2018-11-23 15:49:47,926 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 15:49:47,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:49:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 15:49:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-23 15:49:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:49:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-23 15:49:47,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-23 15:49:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:47,935 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-23 15:49:47,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:49:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-23 15:49:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 15:49:47,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:47,937 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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 15:49:47,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:47,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-23 15:49:47,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 15:49:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:47,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:48,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 15:49:48,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:48,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-23 15:49:48,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:49:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:49:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:49:48,061 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-23 15:49:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:48,156 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-23 15:49:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:49:48,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-23 15:49:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:48,158 INFO L225 Difference]: With dead ends: 71 [2018-11-23 15:49:48,158 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 15:49:48,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:49:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 15:49:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-23 15:49:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 15:49:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-23 15:49:48,168 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-23 15:49:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-23 15:49:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:49:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-23 15:49:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 15:49:48,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:48,170 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:48,170 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-23 15:49:48,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:48,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 15:49:48,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:48,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:49:48,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:49:48,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:49:48,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 15:49:48,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:48,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 15:49:48,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:49:48,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:49:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:49:48,369 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 14 states. [2018-11-23 15:49:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:48,623 INFO L93 Difference]: Finished difference Result 127 states and 238 transitions. [2018-11-23 15:49:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 15:49:48,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-23 15:49:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:48,625 INFO L225 Difference]: With dead ends: 127 [2018-11-23 15:49:48,625 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 15:49:48,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:49:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 15:49:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2018-11-23 15:49:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 15:49:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2018-11-23 15:49:48,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 80 [2018-11-23 15:49:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:48,639 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2018-11-23 15:49:48,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:49:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2018-11-23 15:49:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 15:49:48,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:48,642 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:48,642 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:48,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1162571493, now seen corresponding path program 1 times [2018-11-23 15:49:48,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:48,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:48,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 15:49:48,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:48,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:48,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:48,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 15:49:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 15:49:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:49:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:49:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:49:48,821 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand 15 states. [2018-11-23 15:49:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:49,146 INFO L93 Difference]: Finished difference Result 180 states and 349 transitions. [2018-11-23 15:49:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 15:49:49,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2018-11-23 15:49:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:49,150 INFO L225 Difference]: With dead ends: 180 [2018-11-23 15:49:49,150 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 15:49:49,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-11-23 15:49:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 15:49:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-11-23 15:49:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 15:49:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2018-11-23 15:49:49,166 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 95 [2018-11-23 15:49:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:49,167 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2018-11-23 15:49:49,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:49:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2018-11-23 15:49:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 15:49:49,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:49,169 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 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 15:49:49,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:49,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 367128822, now seen corresponding path program 2 times [2018-11-23 15:49:49,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:49,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:49,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 15:49:49,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:49,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:49:49,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:49:49,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:49:49,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 15:49:49,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2018-11-23 15:49:49,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:49:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:49:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:49:49,369 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand 15 states. [2018-11-23 15:49:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:49,748 INFO L93 Difference]: Finished difference Result 253 states and 504 transitions. [2018-11-23 15:49:49,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 15:49:49,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-23 15:49:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:49,752 INFO L225 Difference]: With dead ends: 253 [2018-11-23 15:49:49,752 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 15:49:49,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-11-23 15:49:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 15:49:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2018-11-23 15:49:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 15:49:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 275 transitions. [2018-11-23 15:49:49,772 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 275 transitions. Word has length 83 [2018-11-23 15:49:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:49,773 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 275 transitions. [2018-11-23 15:49:49,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:49:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 275 transitions. [2018-11-23 15:49:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 15:49:49,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:49,777 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 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 15:49:49,777 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:49,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1677699577, now seen corresponding path program 1 times [2018-11-23 15:49:49,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:49,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-23 15:49:49,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:49,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:49,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 15:49:49,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:49,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-11-23 15:49:49,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:49:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:49:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:49:49,952 INFO L87 Difference]: Start difference. First operand 154 states and 275 transitions. Second operand 11 states. [2018-11-23 15:49:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:50,104 INFO L93 Difference]: Finished difference Result 329 states and 661 transitions. [2018-11-23 15:49:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:49:50,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-23 15:49:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:50,106 INFO L225 Difference]: With dead ends: 329 [2018-11-23 15:49:50,106 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 15:49:50,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:49:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 15:49:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2018-11-23 15:49:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 15:49:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 315 transitions. [2018-11-23 15:49:50,122 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 315 transitions. Word has length 96 [2018-11-23 15:49:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 315 transitions. [2018-11-23 15:49:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:49:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 315 transitions. [2018-11-23 15:49:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 15:49:50,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:50,125 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:50,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2123215105, now seen corresponding path program 2 times [2018-11-23 15:49:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:50,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:50,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:50,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-11-23 15:49:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:50,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:49:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:49:50,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:49:50,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:49:50,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 67 proven. 73 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 15:49:50,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:50,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 15:49:50,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:49:50,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:49:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:49:50,338 INFO L87 Difference]: Start difference. First operand 172 states and 315 transitions. Second operand 17 states. [2018-11-23 15:49:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:50,592 INFO L93 Difference]: Finished difference Result 345 states and 709 transitions. [2018-11-23 15:49:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 15:49:50,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-23 15:49:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:49:50,594 INFO L225 Difference]: With dead ends: 345 [2018-11-23 15:49:50,594 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 15:49:50,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2018-11-23 15:49:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 15:49:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-11-23 15:49:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 15:49:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2018-11-23 15:49:50,604 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 122 [2018-11-23 15:49:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:49:50,604 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2018-11-23 15:49:50,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:49:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2018-11-23 15:49:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 15:49:50,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:49:50,606 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:50,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:49:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 3 times [2018-11-23 15:49:50,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:50,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:50,636 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 := 5; VAL [main_~x~0=5] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); 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 #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); 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 #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #51#return; VAL [main_~x~0=5, |main_#t~ret4|=5] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=5, main_~x~0=5] [?] assume 5 == ~result~0; VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38-L40] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38-L40] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-23 15:49:50,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:49:50 BoogieIcfgContainer [2018-11-23 15:49:50,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:49:50,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:49:50,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:49:50,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:49:50,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:46" (3/4) ... [2018-11-23 15:49:50,738 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 := 5; VAL [main_~x~0=5] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=5] [?] ~n := #in~n; VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(~n < 1); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo1_~n=5, |fibo1_#in~n|=5] [?] CALL call #t~ret0 := fibo2(~n - 1); 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 #57#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3] [?] CALL call #t~ret1 := fibo2(~n - 2); 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 #59#return; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#t~ret0|=3, |fibo1_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] assume true; VAL [fibo1_~n=5, |fibo1_#in~n|=5, |fibo1_#res|=5] [?] RET #51#return; VAL [main_~x~0=5, |main_#t~ret4|=5] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=5, main_~x~0=5] [?] assume 5 == ~result~0; VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38-L40] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8-L14] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L10-L14] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L4] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38-L40] assume 5 == ~result~0; VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 5; VAL [~x~0=5] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=5] [L7-L15] ~n := #in~n; VAL [#in~n=5, ~n=5] [L8] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L10] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L13] CALL call #t~ret0 := fibo2(~n - 1); 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~ret0 := fibo2(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L13] CALL call #t~ret1 := fibo2(~n - 2); 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~ret1 := fibo2(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [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=5, #res=5, ~n=5] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=5, ~x~0=5] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=5, ~x~0=5] [L38] COND TRUE 5 == ~result~0 VAL [~result~0=5, ~x~0=5] [L39] assert false; VAL [~result~0=5, ~x~0=5] [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-23 15:49:51,065 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3337671d-3581-469d-8671-f8574d0e2a9f/bin-2019/uautomizer/witness.graphml [2018-11-23 15:49:51,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:49:51,066 INFO L168 Benchmark]: Toolchain (without parser) took 4957.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 958.0 MB in the beginning and 1.0 GB in the end (delta: -75.0 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,067 INFO L168 Benchmark]: CDTParser took 0.14 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 15:49:51,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,068 INFO L168 Benchmark]: Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:49:51,068 INFO L168 Benchmark]: RCFGBuilder took 167.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,068 INFO L168 Benchmark]: TraceAbstraction took 4284.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,069 INFO L168 Benchmark]: Witness Printer took 329.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:51,071 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.14 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 150.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 167.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4284.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. * Witness Printer took 329.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 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 = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 13 OverallIterations, 9 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 330 SDtfs, 426 SDslu, 1862 SDs, 0 SdLazy, 2413 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 655 SyntacticMatches, 2 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 107 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1460 NumberOfCodeBlocks, 1460 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1329 ConstructedInterpolants, 0 QuantifiedInterpolants, 163767 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1491 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1812/2170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...